Sciweavers

2310 search results - page 69 / 462
» Coloring Random Graphs
Sort
View
ICIP
1998
IEEE
14 years 10 months ago
Lip Features Automatic Extraction
An algorithm for speaker's lip segmentation and features extraction is presented in this paper. A color video sequence of speaker's face is acquired, under natural light...
Franck Luthon, Marc Liévin
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 3 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
CPC
2011
189views Education» more  CPC 2011»
13 years 4 months ago
A Counter-Intuitive Correlation in a Random Tournament
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
Sven Erick Alm, Svante Linusson
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 6 months ago
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
ICC
2007
IEEE
101views Communications» more  ICC 2007»
14 years 3 months ago
Transmission Scheduling in Sensor Networks via Directed Edge Coloring
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
Maggie X. Cheng, Li Yin