1243 search results - page 129 / 249 » On the locality of bounded growth |
155
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
172
click to vote
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
A “graphics for vision” approach is proposed to address the problem of reconstruction from a large and imperfect data set: reconstruction on demand by tensor voting, or ROD-TV...
200
click to vote
CONCUR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
180
click to vote
AAAI
2008
15 years 8 months ago
2008
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
177
click to vote
TCS
2008
15 years 6 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...