890 search results - page 106 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
164
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
162
click to vote
HICSS
2006
IEEE
16 years 11 days ago
2006
IEEE
The classical (ad hoc) document retrieval problem has been traditionally approached through ranking according to heuristically developed functions (such as tf.idf or bm25) or gene...
152
click to vote
ERCIMDL
2008
Springer
15 years 8 months ago
2008
Springer
Taking the temporal dimension into account in searching, i.e., using time of content creation as part of the search condition, is now gaining increasingly interest. However, in the...
347
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
145
click to vote
ECIS
2003
15 years 7 months ago
2003
One of the primary methods employed by researchers to judge the merits of new heuristics and algorithms is to run them on accepted benchmark test cases and comparing their perform...