1160 search results - page 139 / 232 » Query Processing and Optimization for Pictorial Query Trees |
SSDBM
2003
IEEE
15 years 3 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
134
Voted
CINQ
2004
Springer
15 years 2 months ago
2004
Springer
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
90
Voted
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
While provenance has been extensively studied in the literature, the efficient evaluation of provenance queries remains an open problem. Traditional query optimization techniques...
87
Voted
ICML
2005
IEEE
15 years 11 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
WISE
2002
Springer
15 years 3 months ago
2002
Springer
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...