Sciweavers

3020 search results - page 194 / 604
» Optimal partition trees
Sort
View
ICALP
2001
Springer
15 years 11 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, ...
GRC
2009
IEEE
15 years 9 months ago
A step toward code granulation space
This paper proposes a code granulation space which can be applied to program construction and processing. Each granule in the space is defined as an improvement to the seed progra...
Yinliang Zhao
SBBD
2007
148views Database» more  SBBD 2007»
15 years 8 months ago
Bulk-loading Dynamic Metric Access Methods
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
Thiago Galbiatti Vespa, Caetano Traina Jr., Agma J...
SBBD
2007
149views Database» more  SBBD 2007»
15 years 8 months ago
Embedding Similarity Joins into Native XML Databases
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such ...
Leonardo Ribeiro, Theo Härder
SIGPRO
2002
114views more  SIGPRO 2002»
15 years 6 months ago
Error resilience and recovery in streaming of embedded video
The three-dimensional (3-D) SPIHT coder is a scalable or embedded coder that has proved its efficiency and its real-time capability in compression of video. A forward-error-correc...
Sungdae Cho, William A. Pearlman