Sciweavers

605 search results - page 109 / 121
» Probabilistic state space search
Sort
View
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
11 years 10 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
AAAI
2004
13 years 9 months ago
Learning and Applying Competitive Strategies
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...
Esther Lock, Susan L. Epstein
CVPR
2003
IEEE
14 years 9 months ago
Bayesian Tangent Shape Model: Estimating Shape and Pose Parameters via Bayesian Inference
12 In this paper we study the problem of shape analysis and its application in locating facial feature points on frontal faces. We propose a Bayesian inference solution based on ta...
Yi Zhou, Lie Gu, HongJiang Zhang
CVPR
2007
IEEE
14 years 9 months ago
Recognizing objects by piecing together the Segmentation Puzzle
We present an algorithm that recognizes objects of a given category using a small number of hand segmented images as references. Our method first over segments an input image into...
Jianbo Shi, Timothée Cour
CAV
2009
Springer
184views Hardware» more  CAV 2009»
14 years 8 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta