Sciweavers

1567 search results - page 233 / 314
» Compressing Relations and Indexes
Sort
View
FCT
1991
Springer
14 years 1 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
PARLE
1994
14 years 1 months ago
Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
Louis H. Ziantz, Can C. Özturan, Boleslaw K. ...
AAAI
2007
14 years 20 days ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang
AMFG
2005
IEEE
183views Biometrics» more  AMFG 2005»
14 years 9 days ago
Robust Automatic Human Identification Using Face, Mouth, and Acoustic Information
Discriminatory information about person identity is multimodal. Yet, most person recognition systems are unimodal, e.g. the use of facial appearance. With a view to exploiting the ...
Niall A. Fox, Ralph Gross, Jeffrey F. Cohn, Richar...
DEXAW
2007
IEEE
142views Database» more  DEXAW 2007»
14 years 3 days ago
Synopsis Data Structures for XML Databases: Models, Issues, and Research Perspectives
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several ...
Angela Bonifati, Alfredo Cuzzocrea