Sciweavers

145 search results - page 21 / 29
» Strong Colorings of Hypergraphs
Sort
View
SIROCCO
2000
14 years 10 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
TIP
2010
132views more  TIP 2010»
14 years 7 months ago
Compress Compound Images in H.264/MPGE-4 AVC by Exploiting Spatial Correlation
—Compound images are a combination of text, graphics and natural image. They present strong anisotropic features, especially on the text and graphics parts. These anisotropic fea...
Cuiling Lan, Guangming Shi, Feng Wu
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 1 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
ICCV
2005
IEEE
15 years 3 months ago
Registration of Multimodal Fluorescein Images Sequence of the Retina
In this study we present a Y-feature extraction method for registering color and fluorescein angiograms of the retina. The registration of multimodal fluorescein imagery requires ...
Tae Eun Choe, Isaac Cohen
CVIU
2006
219views more  CVIU 2006»
14 years 9 months ago
Boundary matting for view synthesis
In the last few years, new view synthesis has emerged as an important application of 3D stereo reconstruction. While the quality of stereo has improved, it is still imperfect, and...
Samuel W. Hasinoff, Sing Bing Kang, Richard Szelis...