Sciweavers

18572 search results - page 565 / 3715
» High performance C
Sort
View
AUSAI
2003
Springer
16 years 8 days ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
VLDB
2001
ACM
114views Database» more  VLDB 2001»
15 years 11 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
EDBT
2000
ACM
15 years 11 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 11 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
ASPLOS
1998
ACM
15 years 11 months ago
A Cost-Effective, High-Bandwidth Storage Architecture
This paper describes the Network-Attached Secure Disk (NASD) storage architecture, prototype implementations of NASD drives, array management for our architecture, and three files...
Garth A. Gibson, David Nagle, Khalil Amiri, Jeff B...