Sciweavers

3091 search results - page 43 / 619
» The Color Between Two Others
Sort
View
ICIG
2009
IEEE
15 years 5 months ago
Image Segmentation Via Iterative Geodesic Averaging
We present a simple and fast method for performing unsupervised segmentation. Our method works by centering a square window on each pixel of the input image. Each pixel is then as...
Asmaa Hosni, Michael Bleyer, Margrit Gelautz
CIARP
2010
Springer
14 years 6 months ago
Color Texture Analysis and Classification: An Agent Approach Based on Partially Self-avoiding Deterministic Walks
Abstract. Recently, we have proposed a novel approach of texture analysis that has overcome most of the state-of-art methods. This method considers independent walkers, with a give...
André Ricardo Backes, Alexandre Souto Marti...
JGT
2010
90views more  JGT 2010»
14 years 9 months ago
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
Michael Krivelevich, Raphael Yuster
ISIPTA
1999
IEEE
15 years 3 months ago
Modeling Ellsberg's Paradox in Vague-Vague Cases
We explore a generalization of Ellsberg's paradox (2color scenario) to the Vague-Vague (V-V) case, in which neither of the probabilities (urns) is specified precisely, but on...
Karen M. Kramer, David V. Budescu
ICCAD
2002
IEEE
92views Hardware» more  ICCAD 2002»
15 years 8 months ago
ECO algorithms for removing overlaps between power rails and signal wires
Design ECO commonly happens in industry due to constraints or target changes from manufacturing, marketing, reliability, or performance. At each step, designers usually want to mo...
Hua Xiang, Kai-Yuan Chao, D. F. Wong