Sciweavers

4124 search results - page 339 / 825
» Improved Algorithms for Data Migration
Sort
View
ICALP
2001
Springer
15 years 9 months ago
A Framework for Index Bulk Loading and Dynamization
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, ...
ICASSP
2009
IEEE
15 years 11 months ago
Microarray classification using block diagonal linear discriminant analysis with embedded feature selection
In this paper, block diagonal linear discriminant analysis (BDLDA) is improved and applied to gene expression data. BDLDA is a classification tool with embedded feature selection...
Lingyan Sheng, Roger Pique-Regi, Shahab Asgharzade...
SIGMOD
2005
ACM
212views Database» more  SIGMOD 2005»
16 years 5 months ago
A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification
Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes t...
Philip Bohannon, Michael Flaster, Wenfei Fan, Raje...
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
16 years 2 months ago
Leveraging Temporal Dynamics of Document Content in Relevance Ranking
Many web documents are dynamic, with content changing in varying amounts at varying frequencies. However, current document search algorithms have a static view of the document con...
Jonathan L. Elsas, Susan T. Dumais
ICDT
2009
ACM
121views Database» more  ICDT 2009»
16 years 5 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz