1461 search results - page 100 / 293 » The Cost of Cache-Oblivious Searching |
152
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...
142
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
174
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a f...
171
click to vote
MVA
1994
15 years 7 months ago
1994
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
160
click to vote
CLEF
2010
Springer
15 years 7 months ago
2010
Springer
We propose to use MapReduce to quickly test new retrieval approaches on a cluster of machines by sequentially scanning all documents. We present a small case study in which we use ...