1951 search results - page 203 / 391 » An algorithm for improving graph partitions |
303
click to vote
ECCC
2011
15 years 18 days ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
137
click to vote
COMPGEOM
2009
ACM
16 years 4 days ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
150
click to vote
ICIP
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
156
click to vote
SIBGRAPI
2007
IEEE
15 years 12 months ago
2007
IEEE
This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), w...
149
Voted
ACL
2008
15 years 7 months ago
2008
This work presents an agenda-based approach to improve the robustness of the dialog manager by using dialog examples and n-best recognition hypotheses. This approach supports n-be...