Sciweavers

525 search results - page 80 / 105
» Bidimensionality and geometric graphs
Sort
View
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 6 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
CVPR
2010
IEEE
14 years 4 months ago
A Diffusion Approach to Seeded Image Segmentation
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
ICDAR
2009
IEEE
14 years 3 months ago
2D CAD Data Mining Based on Spatial Relation
In this research, we propose CAD data mining technique to obtain semantic elements without prior knowledge about plans being designed. Our method consists of two steps. The first ...
Hiroaki Kizu, Junko Yamamoto, Takeshi Takeda, Keij...
ICC
2008
IEEE
127views Communications» more  ICC 2008»
14 years 3 months ago
On the Devolution of Large-Scale Sensor Networks in the Presence of Random Failures
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
Fei Xing, Wenye Wang
INFOCOM
2008
IEEE
14 years 3 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff