1523 search results - page 100 / 305 » Partially ordered secretaries |
92
Voted
CLASSIFICATION
2006
15 years 23 days 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...
116
click to vote
TVCG
2011
14 years 7 months 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...
94
Voted
ICASSP
2011
IEEE
14 years 4 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 ...
104
Voted
SPIN
2009
Springer
15 years 7 months 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...
101
Voted
RECSYS
2009
ACM
15 years 7 months 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...