Sciweavers

1047 search results - page 90 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 2 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...
AAAI
2010
13 years 9 months ago
Learning Simulation Control in General Game-Playing Agents
The aim of General Game Playing (GGP) is to create intelligent agents that can automatically learn how to play many different games at an expert level without any human interventi...
Hilmar Finnsson, Yngvi Björnsson
DAGSTUHL
2006
13 years 9 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl
ROMAN
2007
IEEE
181views Robotics» more  ROMAN 2007»
14 years 2 months ago
Efficient Articulated Model Fitting on a Single Image or a Sequence
Abstract—Models that can efficiently, compactly, and semantically represent potential users are important tools for human-robot interaction applications. We model a person as a p...
Matheen Siddiqui, Gérard G. Medioni
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 8 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li