1040 search results - page 197 / 208 » Rounding algorithms for covering problems |
SIAMJO
2002
14 years 9 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
White-box testing is an important method for the early detection of errors during software development. In this process test case generation plays a crucial role, defining appropr...
103
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
SIAMCOMP
1998
14 years 9 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...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
General multi view reconstruction from affine or projective cameras has so far been solved most efficiently using methods of factorizing image data matrices into camera and scene p...