Sciweavers

166 search results - page 19 / 34
» Comparison of two approaches to approximated reasoning
Sort
View
EDBT
2009
ACM
100views Database» more  EDBT 2009»
14 years 13 days ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan
ICADL
2005
Springer
114views Education» more  ICADL 2005»
14 years 1 months ago
Scalability of Databases for Digital Libraries
Search engines of main-stream literature digital libraries such as ACM Digital Library, Google Scholar, and PubMed employ file-based systems, and provide users with a basic boolean...
John Chmura, Nattakarn Ratprasartporn, Gultekin &O...
CORR
2010
Springer
204views Education» more  CORR 2010»
13 years 6 months ago
Predictive State Temporal Difference Learning
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
Byron Boots, Geoffrey J. Gordon
ECCV
2008
Springer
14 years 9 months ago
Regular Texture Analysis as Statistical Model Selection
An approach to the analysis of images of regular texture is proposed in which lattice hypotheses are used to define statistical models. These models are then compared in terms of t...
Junwei Han, Stephen J. McKenna, Ruixuan Wang
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
13 years 6 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos