3894 search results - page 182 / 779 » Approximation Algorithms for Biclustering Problems |
189
Voted
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
154
Voted
CC
2007
Springer
16 years 1 months ago
2007
Springer
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
192
click to vote
CVPR
2009
IEEE
17 years 2 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...
182
click to vote
ATAL
2010
Springer
15 years 8 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...
178
click to vote
ICCAD
2001
IEEE
16 years 3 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...