3875 search results - page 210 / 775 » Approximation algorithms for the 0-extension problem |
174
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
158
Voted
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
150
click to vote
ICCAD
2001
IEEE
16 years 2 months ago
2001
IEEE
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
173
click to vote
ICCCN
2008
IEEE
16 years 15 days ago
2008
IEEE
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
175
click to vote
SIAMCOMP
1998
15 years 5 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...