Sciweavers

7930 search results - page 79 / 1586
» Greedy in Approximation Algorithms
Sort
View
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 6 months ago
Maximizing the spread of influence through a social network
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 technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 6 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
DCOSS
2008
Springer
15 years 8 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
INFOCOM
2010
IEEE
15 years 4 months ago
Optimal Probing for Unicast Network Delay Tomography
—Network tomography has been proposed to ascertain internal network performances from end-to-end measurements. In this work, we present priority probing, an optimal probing schem...
Yu Gu, Guofei Jiang, Vishal Singh, Yueping Zhang
CICLING
2005
Springer
15 years 11 months ago
Automatic Annotation of Corpora for Text Summarisation: A Comparative Study
This paper presents two methods which automatically produce annotated corpora for text summarisation on the basis of human abstracts. Both methods identify a set of sentences from ...
Constantin Orasan