1940 search results - page 174 / 388 » Optimizing search engines using clickthrough data |
167
click to vote
PPPJ
2009
ACM
16 years 1 months ago
2009
ACM
Dynamic compilers can optimize application code speciļ¬cally for observed code behavior. Such behavior does not have to be stable across the entire program execution to be beneļ¬...
256
click to vote
ICDE
2000
IEEE
16 years 7 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
181
click to vote
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
In software testing, it is often desirable to ļ¬nd test inputs that exercise speciļ¬c program features. To ļ¬nd these inputs by hand is extremely time-consuming, especially whe...
174
click to vote
CGO
2006
IEEE
16 years 15 days ago
2006
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
171
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...