Sciweavers

439 search results - page 18 / 88
» Unnesting Arbitrary Queries
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 2 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
CGF
2008
144views more  CGF 2008»
13 years 10 months ago
High Performance GPU-based Proximity Queries using Distance Fields
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modeling, augm...
T. Morvan, M. Reimers, E. Samset
CIKM
2006
Springer
14 years 1 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
ICDE
2005
IEEE
165views Database» more  ICDE 2005»
14 years 11 months ago
Querying and Visualizing Gridded Datasets for e-Science
We demonstrate a web service and client application for querying and visualizing datasets defined over arbitrary topological grids. Such gridded datasets are produced by Earth sci...
Bill Howe, David Maier
AI
2010
Springer
13 years 10 months ago
Learning conditional preference networks
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
Frédéric Koriche, Bruno Zanuttini