1523 search results - page 100 / 305 » Partially ordered secretaries |
147
Voted
CLASSIFICATION
2006
15 years 5 months ago
2006
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
171
click to vote
TVCG
2011
15 years 16 days ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
151
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
In this paper, we propose a new method for computing and applying language model look-ahead in a dynamic network decoder, exploiting the sparseness of backing-off n-gram language ...
152
click to vote
SPIN
2009
Springer
16 years 4 days ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
149
Voted
RECSYS
2009
ACM
16 years 3 days ago
2009
ACM
Recommender systems aim to substantially reduce information overload by suggesting lists of similar items that users may find interesting. Caching has been a useful technique for...