4377 search results - page 497 / 876 » Mass problems and randomness |
192
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
173
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
194
Voted
ICCVW
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
170
click to vote
CPM
1998
Springer
15 years 11 months ago
1998
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
147
click to vote
SPAA
1990
ACM
15 years 11 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...