1184 search results - page 104 / 237 » Algorithmic Results in List Decoding |
170
Voted
SIGIR
2012
ACM
13 years 5 months ago
2012
ACM
We demonstrate the merits of using inter-document similarities for federated search. Specifically, we study a resultsmerging method that utilizes information induced from cluster...
138
click to vote
JCO
2008
15 years 3 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
252
Voted
WADS
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
101
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
117
click to vote
ISSS
1998
IEEE
15 years 7 months ago
1998
IEEE
Commonly used scheduling algorithms in high-level synthesis are not capable of sharing resources across process boundaries. This results in the usage of at least one resource per ...