Sciweavers

767 search results - page 103 / 154
» On Clustering Using Random Walks
Sort
View
TON
2010
147views more  TON 2010»
13 years 6 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
ICPR
2004
IEEE
14 years 8 months ago
Fast Robust GA-Based Ellipse Detection
This paper discusses a novel and effective technique for extracting multiple ellipses from an image, using a Multi-Population Genetic Algorithm (MPGA). MPGA evolves a number of su...
Jie Yao, Nawwaf N. Kharma, Peter Grogono
MOBICOM
2003
ACM
14 years 27 days ago
Towards realistic mobility models for mobile ad hoc networks
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin...
ICCV
2003
IEEE
14 years 9 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
CVPR
2007
IEEE
14 years 2 months ago
Optimized Color Sampling for Robust Matting
Image matting is the problem of determining for each pixel in an image whether it is foreground, background, or the mixing parameter, ”alpha”, for those pixels that are a mixt...
Jue Wang, Michael F. Cohen