Sciweavers

11394 search results - page 565 / 2279
» Error-Correcting Data Structures
Sort
View
MICAI
2004
Springer
16 years 16 days ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
VLDB
2004
ACM
100views Database» more  VLDB 2004»
16 years 15 days ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
DEXAW
2003
IEEE
131views Database» more  DEXAW 2003»
16 years 14 days ago
Having a BLAST: Analyzing Gene Sequence Data with BlastQuest
An essential problem for biologists is the processing and evaluation of BLAST results. We advocate the deployment of database technology and describe a userdriven tool, called Bla...
William G. Farmerie, Joachim Hammer, Li Liu, Marku...
VLDB
1994
ACM
134views Database» more  VLDB 1994»
15 years 11 months ago
V-Trees - A Storage Method for Long Vector Data
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also opt...
Maurício R. Mediano, Marco A. Casanova, Mar...
CDC
2008
IEEE
15 years 9 months ago
Informative data: How to get just sufficiently rich?
Prediction error identification requires that data be informative with respect to the chosen model structure. Whereas sufficient conditions for informative experiments have been av...
Michel Gevers, Alexandre S. Bazanella, Ljubisa Mis...