Sciweavers

1272 search results - page 149 / 255
» Approximate Parameterized Matching
Sort
View
KSEM
2009
Springer
15 years 10 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
IROS
2008
IEEE
230views Robotics» more  IROS 2008»
15 years 10 months ago
Visual recognition of grasps for human-to-robot mapping
— This paper presents a vision based method for grasp classification. It is developed as part of a Programming by Demonstration (PbD) system for which recognition of objects and...
Hedvig Kjellström, Javier Romero, Danica Krag...
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
15 years 10 months ago
Learning What Makes a Society Tick
We present a machine learning methodology (models, algorithms, and experimental data) to discovering the agent dynamics that drive the evolution of the social groups in a communit...
Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Is...
163
Voted
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
15 years 9 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
129
Voted
FOCS
2005
IEEE
15 years 9 months ago
The Closest Substring problem with small distances
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Dániel Marx