2069 search results - page 67 / 414 » Linear time algorithms for Clobber |
158
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
128
click to vote
RANDOM
1999
Springer
15 years 8 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
117
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
138
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
230
click to vote
VLDB
2006
ACM
16 years 4 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...