Sciweavers

5606 search results - page 901 / 1122
» Randomization Techniques for Graphs.
Sort
View
ICFP
2002
ACM
16 years 6 months ago
An experimental study of renewal-older-first garbage collection
Generational collection has improved the efficiency of garbage collection in fast-allocating programs by focusing on collecting young garbage, but has done little to reduce the co...
Lars Thomas Hansen, William D. Clinger
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
16 years 6 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 6 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
ICDE
2010
IEEE
224views Database» more  ICDE 2010»
16 years 6 months ago
Probabilistic Declarative Information Extraction
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...
Daisy Zhe Wang, Eirinaios Michelakis, Joseph M. He...
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
16 years 3 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio