2107 search results - page 32 / 422 » Computing Small Search Numbers in Linear Time |
JAIR
2011
13 years 2 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
ROBOCUP
2004
Springer
14 years 1 months ago
2004
Springer
In this work, a novel search strategy for autonomous search and rescue robots, that is highly suitable for the environments when the aid of human rescuers or search dogs is complet...
ACSC
2006
IEEE
14 years 1 months ago
2006
IEEE
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In...