12265 search results - page 246 / 2453 » Knuth-Morris-Pratt Algorithm: An Analysis |
170
click to vote
SODA
1994
ACM
15 years 8 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
305
click to vote
Publication
Images with large areas of low texture pose significant challenge to stereo algorithms. We propose a novel segmentation based stereo scheme tuned to handle such scenes. We combine ...
171
click to vote
MST
1998
15 years 6 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
211
click to vote
VMCAI
2012
Springer
14 years 2 months ago
2012
Springer
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
171
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...