Sciweavers

1208 search results - page 84 / 242
» On Counting Generalized Colorings
Sort
View
SASO
2008
IEEE
14 years 3 months ago
Towards Desynchronization of Multi-hop Topologies
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
Julius Degesys, Radhika Nagpal
SIAMDM
2010
123views more  SIAMDM 2010»
13 years 7 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
ECCV
2002
Springer
14 years 11 months ago
Diffuse-Specular Separation and Depth Recovery from Image Sequences
Specular reflections present difficulties for many areas of computer vision such as stereo and segmentation. To separate specular and diffuse reflection components, previous approa...
Stephen Lin, Yuanzhen Li, Sing Bing Kang, Xin Tong...
RANDOM
1999
Springer
14 years 1 months ago
Approximation of Multi-color Discrepancy
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
Benjamin Doerr, Anand Srivastav
CC
2006
Springer
124views System Software» more  CC 2006»
14 years 27 days ago
Hybrid Optimizations: Which Optimization Algorithm to Use?
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...