Sciweavers

720 search results - page 122 / 144
» Nonrepetitive colorings of graphs
Sort
View
FGR
2008
IEEE
346views Biometrics» more  FGR 2008»
14 years 2 months ago
Markov random field models for hair and face segmentation
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
Kuang-chih Lee, Dragomir Anguelov, Baris Sumengen,...
MIRAGE
2007
Springer
14 years 1 months ago
Segmentation of Soft Shadows Based on a Daylight- and Penumbra Model
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of an alpha overlay shadow model. Previou...
Michael Nielsen, Claus B. Madsen
ISMVL
2006
IEEE
109views Hardware» more  ISMVL 2006»
14 years 1 months ago
Towards Solving Many-Valued MaxSAT
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
Josep Argelich, Xavier Domingo, Chu Min Li, Felip ...
ICOIN
2005
Springer
14 years 1 months ago
RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseu...
ICCS
2004
Springer
14 years 27 days ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov