Sciweavers

1022 search results - page 158 / 205
» New models and algorithms for programmable networks
Sort
View
NIPS
2000
15 years 1 months ago
An Information Maximization Approach to Overcomplete and Recurrent Representations
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
Oren Shriki, Haim Sompolinsky, Daniel D. Lee
DCOSS
2006
Springer
15 years 4 months ago
Distributed Optimal Estimation from Relative Measurements for Localization and Time Synchronization
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
Prabir Barooah, Neimar Machado da Silva, Joã...
CCGRID
2007
IEEE
15 years 6 months ago
Study of Different Replica Placement and Maintenance Strategies in Data Grid
Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in da...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
97
Voted
IFIP
2004
Springer
15 years 5 months ago
The Driving Philosophers
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a rou...
Sébastien Baehni, Roberto Baldoni, Rachid G...
101
Voted
ITNG
2008
IEEE
15 years 7 months ago
Deadlock-Free Multi-Path Routing for Torus-Based NoCs
In our previous work, a Multi-Path Routing (MPR) scheme was proposed to maximize the data throughput for torus-based NoCs by utilizing multiple paths for concurrent data transmiss...
Yaoting Jiao, Mei Yang, Yingtao Jiang, Yulu Yang, ...