10608 search results - page 632 / 2122 » Complexity of O'Hara's Algorithm |
160
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
181
click to vote
SIGIR
1997
ACM
15 years 11 months ago
1997
ACM
This paper presents a model for retrieval of images from a large World Wide Web based collection. Rather than considering complex visual recognition algorithms, the model presente...
190
click to vote
ASPDAC
2001
ACM
15 years 11 months ago
2001
ACM
This paper describes a novel approach to high-level synthesis of complex pipelined circuits, including pipelined circuits with feedback. This approach combines a high-level, modula...
170
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
177
click to vote
CCA
2005
Springer
15 years 9 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...