1403 search results - page 173 / 281 » Set cover algorithms for very large datasets |
178
click to vote
SSD
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
189
click to vote
HPDC
2010
IEEE
15 years 7 months ago
2010
IEEE
Large scale bioinformatics experiments are usually composed by a set of data flows generated by a chain of activities (programs or services) that may be modeled as scientific work...
165
click to vote
IOPADS
1996
15 years 7 months ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
151
click to vote
ICASSP
2008
IEEE
16 years 24 days ago
2008
IEEE
A variant of the k-nearest neighbor algorithm is proposed for image interpolation. Instead of using a static volume or static k, the proposed algorithm determines a dynamic k that...
170
click to vote
ACL
2009
15 years 4 months ago
2009
Iterative bootstrapping algorithms are typically compared using a single set of handpicked seeds. However, we demonstrate that performance varies greatly depending on these seeds,...