2797 search results - page 245 / 560 » Code query by example |
138
click to vote
ICIP
1999
IEEE
16 years 5 months ago
1999
IEEE
Researchers are currently more interested in searching for fragments that are similar to a query, than a total data item that is similar to a query; the search interest is for &qu...
206
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
122
Voted
WWW
2006
ACM
16 years 4 months ago
2006
ACM
Determining the similarity of short text snippets, such as search queries, works poorly with traditional document similarity measures (e.g., cosine), since there are often few, if...
146
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
131
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...