3875 search results - page 134 / 775 » Approximation algorithms for the 0-extension problem |
165
click to vote
DFG
2009
Springer
16 years 1 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
167
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
189
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
160
click to vote
TAMC
2007
Springer
16 years 16 days ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
231
click to vote
SIAMCOMP
2011
15 years 1 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...