Sciweavers

121 search results - page 10 / 25
» First-Order Queries over One Unary Function
Sort
View
VLDB
1994
ACM
118views Database» more  VLDB 1994»
14 years 3 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
15 years 7 days ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
IACR
2011
106views more  IACR 2011»
12 years 10 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
AAAI
2011
12 years 11 months ago
Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!
Utility elicitation is an important component of many applications, such as decision support systems and recommender systems. Such systems query users about their preferences and ...
Paolo Viappiani, Craig Boutilier
ACL
2009
13 years 8 months ago
Exploiting Bilingual Information to Improve Web Search
Web search quality can vary widely across languages, even for the same information need. We propose to exploit this variation in quality by learning a ranking function on bilingua...
Wei Gao, John Blitzer, Ming Zhou, Kam-Fai Wong