459 search results - page 69 / 92 » Computational Complexity of Probabilistic Disambiguation |
SIGMETRICS
2006
ACM
15 years 5 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
102
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
151
Voted
ICTAI
2003
IEEE
15 years 5 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
CVPR
2000
IEEE
15 years 4 months ago
2000
IEEE
Corners and curves are important image features in many vision-based applications. Corners are usually more stable and easier to match than curves,while curves contain richer info...
101
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...