Sciweavers

1038 search results - page 189 / 208
» Space-Bounded Query Approximation
Sort
View
PODS
1999
ACM
121views Database» more  PODS 1999»
15 years 3 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
AIPS
2008
15 years 1 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
CIKM
2008
Springer
15 years 1 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 20 days ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
ALMOB
2008
92views more  ALMOB 2008»
14 years 11 months ago
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...
Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You