Sciweavers

1749 search results - page 108 / 350
» Conditional colorings of graphs
Sort
View
LATIN
2010
Springer
16 years 1 months ago
Some Observations on Holographic Algorithms
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
Leslie G. Valiant
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
16 years 19 days ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
ICIP
2009
IEEE
16 years 7 months ago
Color Constancy Using Denoising Methods And Cepstral Analysis
We address here the problem of color constancy and propose two new methods for achieving color constancythe first method uses denoising techniques such as a Gaussian filter, Media...
ICYCS
2008
IEEE
16 years 26 days ago
FAST CASH: FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network
— Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...
Panlong Yang, Guihai Chen
FCT
2007
Springer
15 years 10 months ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee