1632 search results - page 14 / 327 » Sublinear Time Algorithms for Metric Space Problems |
128
click to vote
COCO
2010
Springer
15 years 5 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
347
click to vote
ICDE
2000
IEEE
16 years 4 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
152
click to vote
CCCG
2010
15 years 4 months ago
2010
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
145
click to vote
BMCBI
2010
15 years 19 days ago
2010
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
219
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...