Sciweavers

634 search results - page 91 / 127
» Fast Evaluation Techniques for Complex Similarity Queries
Sort
View
PRL
2010
181views more  PRL 2010»
13 years 6 months ago
Gait recognition without subject cooperation
The strength of gait, compared to other biometrics, is that it does not require cooperative subjects. Previoius gait recognition approaches were evaluated using a gallery set cons...
Khalid Bashir, Tao Xiang, Shaogang Gong
VLDB
1999
ACM
112views Database» more  VLDB 1999»
14 years 8 days ago
Context-Based Prefetch for Implementing Objects on Relations
When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of roundtrips to the database. This is especial...
Philip A. Bernstein, Shankar Pal, David Shutt
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 8 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
AAAI
2012
11 years 10 months ago
Kernel-Based Reinforcement Learning on Representative States
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
Branislav Kveton, Georgios Theocharous
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 7 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...