Sciweavers

365 search results - page 67 / 73
» Reconfigurations in Graphs and Grids
Sort
View
ACISICIS
2007
IEEE
14 years 4 months ago
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
Gerhard Visser, David L. Dowe
GLOBECOM
2007
IEEE
14 years 4 months ago
End-to-End Throughput-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks
— 1 Wireless mesh networks are deployed as broadband backbones to provide ubiquitous wireless access for residents and local businesses. Utilizing multiple channels has the poten...
Fei Ye, Qing Chen, Zhisheng Niu
MSWIM
2006
ACM
14 years 3 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
SENSYS
2006
ACM
14 years 3 months ago
Lazy cross-link removal for geographic routing
Geographic techniques promise highly scalable any-toany routing in wireless sensor networks. In one thread of research on geographic routing, researchers have explored robust, dis...
Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott S...
IPPS
2005
IEEE
14 years 3 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das