1632 search results - page 241 / 327 » Sublinear Time Algorithms for Metric Space Problems |
139
click to vote
CPM
1999
Springer
15 years 8 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
120
click to vote
ICRA
1994
IEEE
15 years 8 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
161
click to vote
OPODIS
2007
15 years 5 months ago
2007
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
131
click to vote
BMVC
2010
15 years 2 months ago
2010
As a problem of high practical appeal but outstanding challenges, computer-based face recognition remains a topic of extensive research attention. In this paper we are specificall...
114
click to vote
ICIC
2007
Springer
15 years 10 months ago
2007
Springer
Whether constant π (i.e., pi) is normal is a confusing problem without any strict theoretical demonstration except for some statistical proof. A new concept of pi series is introd...