Sciweavers

3875 search results - page 734 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
90
Voted
IJCAI
2003
14 years 11 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
AAAI
1998
14 years 11 months ago
Bayesian Q-Learning
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
Richard Dearden, Nir Friedman, Stuart J. Russell
GRAPHICSINTERFACE
2000
14 years 11 months ago
Animating Athletic Motion Planning By Example
Character animation is usually reserved for highly skilled animators and computer programmers because few of the available tools allow the novice or casual user to create compelli...
Ronald A. Metoyer, Jessica K. Hodgins
MVA
1996
118views Computer Vision» more  MVA 1996»
14 years 11 months ago
Correlation-Based Visual Tracking Enhanced by Affine Motion Description
Since conventional correlation-based visual tracking algorithms are based on a single reference block, they often fail to track a target in the following situations: 1) a view of ...
Yoshihisa Adachi, Minoru Asada, Takayuki Nakamura
AAAI
1992
14 years 10 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek