1389 search results - page 90 / 278 » Improved Approximation Algorithms for Label Cover Problems |
120
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Because of the large variation across different environments, a generic classifier trained on extensive data-sets may perform sub-optimally in a particular test environment. In th...
161
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
111
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
117
click to vote
ISSAC
1995
Springer
15 years 6 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
129
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...