2957 search results - page 186 / 592 » The Complexity of Polynomial-Time Approximation |
184
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
143
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
145
click to vote
PG
2003
IEEE
15 years 11 months ago
2003
IEEE
Interactive visualization of complex, real-world light sources has so far not been feasible. In this paper, we present an hardware accelerated direct lighting algorithm based on a...
180
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
139
click to vote
ICIP
2000
IEEE
16 years 7 months ago
2000
IEEE
In this paper, we apply the complexity?regularization principle to Poisson imaging. We formulate a natural distortion measure in image space, and present a connection between comp...