Sciweavers

608 search results - page 117 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 7 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 5 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
CIKM
2009
Springer
14 years 2 months ago
Helping editors choose better seed sets for entity set expansion
Sets of named entities are used heavily at commercial search engines such as Google, Yahoo and Bing. Acquiring sets of entities typically consists of combining semi-supervised exp...
Vishnu Vyas, Patrick Pantel, Eric Crestan
MOBICOM
2003
ACM
14 years 26 days ago
Range-free localization schemes for large scale sensor networks
Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent...
Tian He, Chengdu Huang, Brian M. Blum, John A. Sta...
SIGMOD
1999
ACM
181views Database» more  SIGMOD 1999»
13 years 12 months ago
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
Jeffrey Scott Vitter, Min Wang