2635 search results - page 45 / 527 » Algorithms for the Database Layout Problem |
125
click to vote
PODS
2003
ACM
16 years 2 months ago
2003
ACM
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers...
114
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...
118
click to vote
SODA
2000
ACM
15 years 3 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
106
Voted
PR
2008
15 years 2 months ago
2008
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
115
click to vote
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...