1952 search results - page 266 / 391 » Complete partitions of graphs |
175
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Recent high throughput sequencing technologies are capable of generating a huge amount of data for bacterial genome sequencing projects. Although current sequence assemblers succes...
188
click to vote
ADAEUROPE
2008
Springer
16 years 23 days ago
2008
Springer
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
175
click to vote
ICCV
2007
IEEE
16 years 22 days ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
173
click to vote
PPAM
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
160
click to vote
ICRA
2006
IEEE
16 years 13 days ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...