1456 search results - page 89 / 292 » A search quality evaluation based on objective-subjective me... |
137
click to vote
SIGIR
2006
ACM
16 years 8 days ago
2006
ACM
Information retrieval algorithms leverage various collection statistics to improve performance. Because these statistics are often computed on a relatively small evaluation corpus...
161
click to vote
ICCBR
2007
Springer
16 years 14 days ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
179
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar d...
166
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
160
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
Recently we have applied Look Up Table (LUT) Method for inverse halftoning. We also proposed tree-structure LUT inverse halftoning in order to reduce memory requirements of the LU...