Sciweavers

840 search results - page 65 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
111
Voted
ICIP
2004
IEEE
16 years 4 months ago
Joint server/peer receiver-driven rate-distortion optimized video streaming using asynchronous clocks
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...
Danjue Li, Gene Cheung, Chen-Nee Chuah, S. J. Ben ...
144
Voted
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 6 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
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...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
SBIA
2010
Springer
15 years 1 months ago
High-Level Modeling of Component-Based CSPs
Most of modern constraint modeling languages combine rich constraint languages with mathematical notations to tackle combinatorial optimization problems. Our purpose is to introduc...
Raphaël Chenouard, Laurent Granvilliers, Rica...
109
Voted
ICIP
2003
IEEE
16 years 4 months ago
Sparse decompositions in "incoherent" dictionaries
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...
Morten Nielsen, Rémi Gribonval
107
Voted
DGCI
2005
Springer
15 years 8 months ago
Uncertain Geometry in Computer Vision
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...
Peter Veelaert