204 search results - page 27 / 41 » Testing Triangle-Freeness in General Graphs |
88
Voted
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
137
click to vote
IJCV
2006
14 years 9 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a novel distributed framework for multi-target tracking with an efficient data association computation. A decentralized representation of trackers' motion...
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
78
Voted
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— We consider the problem of distributed estimation of the poses of N cameras in a camera sensor network using image measurements only. The relative rotation and translation (up ...