1162 search results - page 44 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
117
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
129
click to vote
JDA
2010
15 years 2 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...
132
click to vote
ACIVS
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a new method to both track and segment objects in videos. It includes predictions and observations inside an energy function that is minimized with graph cuts. ...
152
click to vote
SWAT
2010
Springer
15 years 9 months ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
139
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...