Sciweavers

4926 search results - page 186 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ACCV
2009
Springer
16 years 23 days ago
Skeleton Graph Matching Based on Critical Points Using Path Similarity
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...
Yao Xu, Bo Wang, Wenyu Liu, Xiang Bai
169
Voted
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 9 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
BIRTHDAY
2003
Springer
15 years 11 months ago
Towards a Brain Compatible Theory of Syntax Based on Local Testability
Chomsky’s theory of syntax came after criticism of probabilistic associative models of word order in sentences. Immediate constituent structures are plausible but their descripti...
Stefano Crespi-Reghizzi, Valentino Braitenberg
190
Voted
DAGM
2008
Springer
15 years 8 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
144
Voted
CPAIOR
2004
Springer
15 years 11 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel