93 search results - page 11 / 19 » Conditional hardness for approximate coloring |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents a new approach to imaging that significantly enhances the dynamic range of a camera. The key idea is to adapt the exposure of each pixel on the image detector,...
VISUALIZATION
1994
IEEE
13 years 11 months ago
1994
IEEE
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
ECCV
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a fully automatic and highly robust head tracking algorithm based on the latest advances in real-time multi-view face detection techniques and multiple cues fus...
SPAA
2004
ACM
14 years 27 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...