Sciweavers

478 search results - page 25 / 96
» Local Search for Computing Normal Circumstances Models
Sort
View
COMMA
2008
13 years 11 months ago
Focused search for Arguments from Propositional Knowledge
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
Vasiliki Efstathiou, Anthony Hunter
CIKM
2009
Springer
14 years 4 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ICPR
2008
IEEE
14 years 4 months ago
Matching images more efficiently with local descriptors
Image matching is a fundamental task for many applications of computer vision. Today it is very popular to represent two matched images as two bags of local descriptors, and the c...
Dong Zhang, Weiqiang Wang, Qingming Huang, Shuqian...
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
14 years 2 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
WACV
2002
IEEE
14 years 3 months ago
Face Model Adaptation using Robust Matching and Active Appearance Models
This paper addresses the 3D tracking of pose and animation of the human face in monocular image sequences using deformable 3D models. For each frame, the proposed adaptation is sp...
Fadi Dornaika, Jörgen Ahlberg