Sciweavers

1185 search results - page 14 / 237
» The Equivalence of Sampling and Searching
Sort
View
ACIVS
2009
Springer
13 years 5 months ago
Enhanced Low-Resolution Pruning for Fast Full-Search Template Matching
Abstract. Gharavi-Alkhansari [1] proposed a full-search equivalent algorithm for speeding-up template matching based on Lp-norm distance measures. This algorithm performs a pruning...
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
CP
2008
Springer
13 years 9 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
NPL
2000
95views more  NPL 2000»
13 years 7 months ago
Bayesian Sampling and Ensemble Learning in Generative Topographic Mapping
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...
Akio Utsugi
DL
1998
Springer
110views Digital Library» more  DL 1998»
13 years 12 months ago
Failure Analysis in Query Construction: Data and Analysis from a Large Sample of Web Queries
This paper reports results from a failure analysis (i.e., incorrect query construction) of 51,473 queries from 18,113 users of Excite, a major Web search engine. Given that many d...
Bernard J. Jansen, Amanda Spink, Tefko Saracevic
IJCAI
2003
13 years 9 months ago
Sampling Combinatorial Spaces Using Biased Random Walks
For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
Jordan Erenrich, Bart Selman