Sciweavers

570 search results - page 18 / 114
» Edge Coloring with Delays
Sort
View
SPAA
1996
ACM
15 years 3 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
ICIP
2009
IEEE
14 years 9 months ago
Detecting and eliminating chromatic aberration in digital images
Chromatic aberration is a form of distortion in color optical devices that produces undesirable color fringes along borders within images. In this paper, we propose a novel method...
Soon-Wook Chung, Byoung-Kwang Kim, Woo-Jin Song
CVPR
2004
IEEE
16 years 1 months ago
Robust Color Object Detection Using Spatial-Color Joint Probability Functions
Object detection in unconstrained images is an important image understanding problem with many potential applications. There has been little success in creating a single algorithm...
David J. Crandall, Jiebo Luo
MST
2010
98views more  MST 2010»
14 years 10 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
IEICET
2008
57views more  IEICET 2008»
14 years 11 months ago
Impact of Well Edge Proximity Effect on Timing
This paper studies impact of the well edge proximity effect on digital circuit delay, based on model parameters extracted from test structures in an industrial 65nm wafer process. ...
Toshiki Kanamoto, Yasuhiro Ogasahara, Keiko Natsum...