Sciweavers

1380 search results - page 189 / 276
» A General Polynomial Sieve
Sort
View
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 8 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
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 6 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
PPOPP
2010
ACM
14 years 6 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Fast High-Dimensional Filtering Using the Permutohedral Lattice
Many useful algorithms for processing images and geometry fall under the general framework of high-dimensional Gaussian ļ¬ltering. This family of algorithms includes bilateral ļ¬...
Andrew Adams, Jongmin Baek, Myers Abraham Davis
ALT
2004
Springer
14 years 5 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identiļ¬es the target concept, starting from an initial concept. Such an algorithm is considered eļ¬ƒcient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...