Sciweavers

5785 search results - page 158 / 1157
» Approximability of Probability Distributions
Sort
View
154
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
112
Voted
DIS
2001
Springer
15 years 8 months ago
Towards a Method of Searching a Diverse Theory Space for Scientific Discovery
Scientists need customizable tools to help them with discovery. We present an adjustable heuristic function for scientific discovery. This function may be considered in either a Mi...
Joseph Phillips
121
Voted
ESANN
2006
15 years 5 months ago
Visual nonlinear discriminant analysis for classifier design
Abstract. We present a new method for analyzing classifiers by visualization, which we call visual nonlinear discriminant analysis. Classifiers that output posterior probabilities ...
Tomoharu Iwata, Kazumi Saito, Naonori Ueda
225
Voted
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 4 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
123
Voted
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 8 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill