840 search results - page 65 / 168 » Inapproximability of Combinatorial Optimization Problems |
86
Voted
ICIP
2004
IEEE
16 years 2 months ago
2004
IEEE
This paper proposes a joint server/peer video streaming architecture for wireless networks, where a receiver can access a video server via an access point using the infrastructure...
121
click to vote
DATE
2004
IEEE
15 years 4 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
203
Voted
SBIA
2010
Springer
14 years 10 months ago
2010
Springer
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
87
Voted
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
The purpose of this paper is to generalize a result by Donoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We conside...
99
Voted
DGCI
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...