Sciweavers

99 search results - page 15 / 20
» Scott's problem for Proper Scott sets
Sort
View
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
13 years 1 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 10 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
14 years 2 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 10 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
BMCBI
2007
168views more  BMCBI 2007»
13 years 9 months ago
Advancing translational research with the Semantic Web
Background: A fundamental goal of the U.S. National Institute of Health (NIH) "Roadmap" is to strengthen Translational Research, defined as the movement of discoveries i...
Alan Ruttenberg, Tim Clark, William Bug, Matthias ...