2957 search results - page 48 / 592 » The Complexity of Polynomial-Time Approximation |
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Taking advantage of the frequency diversity and multiuser diversity in OFDMA based wireless networks, dynamic subcarrier assignment mechanisms have shown to be able to achieve m...
ICRA
2003
IEEE
14 years 28 days ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
FOCS
2002
IEEE
14 years 18 days ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
EMMCVPR
2001
Springer
14 years 4 days ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
GLVLSI
2010
IEEE
13 years 7 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...