Sciweavers

2498 search results - page 237 / 500
» Algorithms for the Topological Watershed
Sort
View
TSP
2008
100views more  TSP 2008»
15 years 6 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
CGF
2004
127views more  CGF 2004»
15 years 6 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery
150
Voted
INFOCOM
2010
IEEE
15 years 5 months ago
Approximate Models for General Cache Networks
Abstract—Many systems employ caches to improve performance. While isolated caches have been studied in-depth, multicache systems are not well understood, especially in networks w...
Elisha J. Rosensweig, James F. Kurose, Donald F. T...
OSN
2011
15 years 1 months ago
A distributed impairment aware QoS framework for all-optical networks
—Different physical impairments can occur in optical transmission systems. Impairments such as fiber nonlinear effects are dependent on network state and vary with traffic and to...
Wenhao Lin, Timothy Hahn, Richard S. Wolff, Brenda...
DATE
2007
IEEE
107views Hardware» more  DATE 2007»
16 years 1 months ago
Routing table minimization for irregular mesh NoCs
The majority of current Network on Chip (NoC) architectures employ mesh topology and use simple static routing, to reduce power and area. However, regular mesh topology is unreali...
Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam...