12265 search results - page 259 / 2453 » Knuth-Morris-Pratt Algorithm: An Analysis |
157
click to vote
ISAAC
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
153
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
A straightforward and efficient way to discover clustering tendencies in data using a recently proposed Maximum Variance Clustering algorithm is proposed. The approach shares the ...
174
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
212
click to vote
ACST
2006
15 years 8 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
166
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...