1053 search results - page 197 / 211 » Shape as Memory Storage |
124
Voted
WWW
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
256
Voted
PLDI
2009
ACM
16 years 3 months ago
2009
ACM
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
122
Voted
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
116
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
109
click to vote
EDBT
2010
ACM
15 years 9 months ago
2010
ACM
: © Self-selecting, self-tuning, incrementally optimized indexes Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-24 database index, adaptive, autonomic, query execution In a re...