Sciweavers

501 search results - page 76 / 101
» Kernel Nearest Neighbor Algorithm
Sort
View
SAC
2009
ACM
14 years 2 months ago
Flexible self-healing gradients
Self-healing gradients are distributed estimates of the distance from each device in a network to the nearest device designated as a source, and are used in many pervasive computi...
Jacob Beal
CEC
2009
IEEE
14 years 2 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang
ESA
2004
Springer
127views Algorithms» more  ESA 2004»
14 years 28 days ago
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest...
Robert Elsässer, Burkhard Monien, Stefan Scha...
PAMI
2011
13 years 2 months ago
Parallel Spectral Clustering in Distributed Systems
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen ...
ICCV
2009
IEEE
15 years 16 days ago
Mode-Detection via Median-Shift
Median-shift is a mode seeking algorithm that relies on computing the median of local neighborhoods, instead of the mean. We further combine median-shift with Locality Sensitive...
Lior Shapira, Shai Avidan, Ariel Shamir