Sciweavers

988 search results - page 67 / 198
» Learning with Local and Global Consistency
Sort
View
AAAI
2000
15 years 7 months ago
A Game-Theoretic Approach to Constraint Satisfaction
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
Phokion G. Kolaitis, Moshe Y. Vardi
PRICAI
2004
Springer
15 years 11 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
JFR
2007
163views more  JFR 2007»
15 years 5 months ago
Real-time localization and elevation mapping within urban search and rescue scenarios
Urban Search And Rescue (USAR) is a time critical task. Rescue teams have to explore a large terrain within a short amount of time in order to locate survivors after a disaster. O...
Alexander Kleiner, Christian Dornhege
ICCV
2003
IEEE
16 years 8 months ago
Recognition with Local Features: the Kernel Recipe
Recent developments in computer vision have shown that local features can provide efficient representations suitable for robust object recognition. Support Vector Machines have be...
Christian Wallraven, Barbara Caputo, Arnulf B. A. ...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
16 years 4 days ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung