Sciweavers

846 search results - page 24 / 170
» Transforming structures by set interpretations
Sort
View
DCC
2008
IEEE
14 years 7 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
IEEEPACT
2009
IEEE
14 years 2 months ago
Automatic Tuning of Discrete Fourier Transforms Driven by Analytical Modeling
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
Basilio B. Fraguela, Yevgen Voronenko, Markus P&uu...
ICPR
2008
IEEE
14 years 8 months ago
Fingerprint indexing based on composite set of reduced SIFT features
Most of current fingerprint indexing schemes utilize features based on global textures and minutiae structures. To extend the existing technology of feature extraction, this paper...
Xin Shuai, Chao Zhang, Pengwei Hao
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
14 years 8 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
TCS
2008
13 years 7 months ago
Absolute versus probabilistic classification in a logical setting
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
Sanjay Jain, Eric Martin, Frank Stephan