Sciweavers

282 search results - page 31 / 57
» Efficient bundle sorting
Sort
View
EDBTW
2006
Springer
13 years 11 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
LREC
2008
130views Education» more  LREC 2008»
13 years 8 months ago
Detecting Co-Derivative Documents in Large Text Collections
We have analyzed the SPEX algorithm by Bernstein and Zobel (2004) for detecting co-derivative documents using duplicate n-grams. Although we totally agree with the claim that not ...
Jan Pomikálek, Pavel Rychlý
FTTCS
2006
132views more  FTTCS 2006»
13 years 7 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
ICIP
2001
IEEE
14 years 9 months ago
Lossy and lossless compression for color-quantized images
An efficient compression scheme for color-quantized images based on progressive coding of color informationhas been developed. Rather than sorting color indexes into a linear list...
Xin Chen, Sam Kwong, Ju-fu Feng
MICCAI
2007
Springer
14 years 8 months ago
Segmentation of Q-Ball Images Using Statistical Surface Evolution
In this article, we develop a new method to segment Q-Ball imaging (QBI) data. We first estimate the orientation distribution function (ODF) using a fast and robust spherical harmo...
Maxime Descoteaux, Rachid Deriche