Sciweavers

382 search results - page 13 / 77
» Data Structures for Dynamic Queries: An Analytical and Exper...
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
CIKM
2009
Springer
14 years 2 months ago
Towards non-directional Xpath evaluation in a RDBMS
XML query languages use directional path expressions to locate data in an XML data collection. They are tightly coupled to the structure of a data collection, and can fail when ev...
Sourav S. Bhowmick, Curtis E. Dyreson, Erwin Leona...
EUROPAR
2003
Springer
14 years 23 days ago
Dynamic Load Partitioning Strategies for Managing Data of Space and Time Heterogeneity in Parallel SAMR Applications
This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applic...
Xiaolin Li, Manish Parashar
JEA
2008
112views more  JEA 2008»
13 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
VLDB
2004
ACM
98views Database» more  VLDB 2004»
14 years 26 days ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel