• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,846
Next 10 →

Maximizing the Spread of Influence Through a Social Network

by David Kempe - In KDD , 2003
"... Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of ..."
Abstract - Cited by 990 (7 self) - Add to MetaCart
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects

An algebraic approach to network coding

by Ralf Koetter, Muriel Médard - IEEE/ACM TRANSACTIONS ON NETWORKING , 2003
"... We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary n ..."
Abstract - Cited by 858 (88 self) - Add to MetaCart
. For the multicast setup we prove that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question. The results are derived for both delay-free networks and networks with delays.

Molecular classification of cancer: class discovery and class prediction by gene expression monitoring

by T. R. Golub, D. K. Slonim, P. Tamayo, C. Huard, M. Gaasenbeek, J. P. Mesirov, H. Coller, M. L. Loh, J. R. Downing, M. A. Caligiuri, C. D. Bloomfield - Science , 1999
"... Although cancer classification has improved over the past 30 years, there has been no general approach for identifying new cancer classes (class discovery) or for assigning tumors to known classes (class prediction). Here, a generic approach to cancer classification based on gene expression monitori ..."
Abstract - Cited by 1779 (19 self) - Add to MetaCart
derived class predictor was able to determine the class of new leukemia cases. The results demonstrate the feasibility of cancer classification based solely on gene expression monitoring and suggest a general strategy for discovering and predicting cancer classes for other types of cancer, independent

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

by Diego Calvanese, G. De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - J. OF AUTOMATED REASONING , 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract - Cited by 497 (123 self) - Add to MetaCart
TBox reasoning is independent of the ABox, and the part of the process requiring access to the ABox can be carried out by an SQL engine, thus taking advantage of the query optimization strategies provided by current Data Base Management Systems. Since it can be shown that even slight extensions

The Nonstochastic Multiarmed Bandit Problem

by Peter Auer, Nicolo Cesa-bianchi, Yoav Freund, Robert E. Schapire - SIAM JOURNAL OF COMPUTING , 2002
"... In the multiarmed bandit problem, a gambler must decide which arm of K non-identical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the trade-off between exploration (trying out ..."
Abstract - Cited by 491 (34 self) - Add to MetaCart
In the multiarmed bandit problem, a gambler must decide which arm of K non-identical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the trade-off between exploration (trying

Maximal Strategies for Paramodulation with Non-Monotonic Orderings

by Miquel Bofill, Guillem Godoy , 1999
"... A west ordering is a well-founded (strict partial) ordering on terms that satisfies the subterm property. In [BGNR99] the completeness of an ordered paramodulation inference system w.r.t. west orderings was proved, thus dropping for the first time the monotonicity requirements on the ordering. Howev ..."
Abstract - Add to MetaCart
. However, the inference system still required the eager selection of negative equations. Here we improve upon [BGNR99] in two directions. On the one hand, we show that the results are compatible with constraint inheritance and the so-called basic strategy [BGLS95, NR95], thus further restricting the search

Power provisioning for a warehousesized computer,”

by Xiaobo Fan , Wolf-Dietrich Weber Luiz , André Barroso - ACM SIGARCH Computer Architecture News, , 2007
"... ABSTRACT Large-scale Internet services require a computing infrastructure that can be appropriately described as a warehouse-sized computing system. The cost of building datacenter facilities capable of delivering a given power capacity to such a computer can rival the recurring energy consumption ..."
Abstract - Cited by 450 (2 self) - Add to MetaCart
consumption tends to vary significantly with the actual computing activity. Effective power provisioning strategies are needed to determine how much computing equipment can be safely and efficiently hosted within a given power budget. In this paper we present the aggregate power usage characteristics of large

Profit-Maximizing Strategies for an Artificial Payment Card Market. Is Learning Possible?

by Biliana Alex, Edward Tsang, Andreas Krause , 2010
"... In this paper, we study the dynamics of competition in the payment card market. This is done through a multi-agent based model, which captures explicitly the commercial transactions at the point of sale between consumers and merchants. Through simulation, we attempt to model the demand for payment i ..."
Abstract - Add to MetaCart
instruments on both sides of the market. Constrained by this complex demand, a Generalised Population Based Incremental Learning (GPBIL) algorithm is applied to find a profit-maximizing strategy, which in addition has to achieve an average number of card transactions. In the present study we compare

Expectation Maximization Strategies for Multi-Atlas Multi-Label Segmentation

by Torsten Rohlfing, Daniel B. Russakoff, Calvin R. Maurer, Jr. - in Information Processing in Medical Imaging , 2003
"... It is well-known in the pattern recognition community that the accuracy of classifications obtained by combining decisions made by independent classifiers can be substantially higher that the accuracy of the individual classifiers. In order to combine multiple segmentations we introduce two exte ..."
Abstract - Cited by 26 (3 self) - Add to MetaCart
extensions to an expectation maximization (EM) algorithm for ground truth estimation based on multiple experts (Warfield et al., MICCAI 2002). The first method repeatedly applies the Warfield algorithm with a subsequent integration step. The second method is a multi-label extension of the Warfield

MAFIA: A maximal frequent itemset algorithm for transactional databases

by Doug Burdick, Manuel Calimlim, Johannes Gehrke - In ICDE , 2001
"... We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very long. The search strategy of our algorithm integrates a depth-first traversal of the itemset lattice with effective pruning ..."
Abstract - Cited by 309 (3 self) - Add to MetaCart
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very long. The search strategy of our algorithm integrates a depth-first traversal of the itemset lattice with effective pruning
Next 10 →
Results 1 - 10 of 7,846
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University