5316 search results - page 249 / 1064 » Which Search Problems Are Random |
160
click to vote
SISAP
2009
IEEE
15 years 11 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
127
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper, we lay the groundwork for extending our previously developed ASyMTRe architecture to enable constructivist learning for multi-robot team tasks. The ASyMTRe archi...
147
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— In this paper, we consider the problem of how background knowledge about usual object arrangements can be utilized by a mobile robot to more efficiently find an object in an ...
152
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
167
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
Active learning is a generic approach to accelerate training of classifiers in order to achieve a higher accuracy with a small number of training examples. In the past, simple ac...