Sciweavers

1493 search results - page 19 / 299
» Local resilience of graphs
Sort
View
ICPP
2005
IEEE
14 years 1 months ago
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
Haiying Shen, Cheng-Zhong Xu
GRID
2007
Springer
13 years 7 months ago
A Local Facility Location Algorithm for Large-scale Distributed Systems
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
Denis Krivitski, Assaf Schuster, Ran Wolff
INFOCOM
2009
IEEE
14 years 2 months ago
A Localized Multi-Hop Desynchronization Algorithm for Wireless Sensor Networks
Abstract—This paper presents a new desynchronization algorithm aimed at providing collision-free transmission scheduling for single-hop and acyclic multi-hop wireless sensor netw...
Hui Kang, Jennifer L. Wong
PR
2010
145views more  PR 2010»
13 years 6 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen
NIPS
2004
13 years 9 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...