Sciweavers

1160 search results - page 96 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 3 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
IJCAI
2007
15 years 2 months ago
Automated Design of Multistage Mechanisms
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
Tuomas Sandholm, Vincent Conitzer, Craig Boutilier
CORR
2008
Springer
120views Education» more  CORR 2008»
15 years 1 months ago
XQuery Join Graph Isolation
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
Torsten Grust, Manuel Mayr, Jan Rittinger
ICOODB
2009
246views Database» more  ICOODB 2009»
14 years 11 months ago
Compiler Plugins Can Handle Nested Languages: AST-Level Expansion of LINQ Queries for Java
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages con...
Miguel Garcia
KR
1992
Springer
15 years 5 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans