Sciweavers

460 search results - page 40 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 8 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
CN
2006
74views more  CN 2006»
13 years 9 months ago
Measurement-based optimal routing on overlay architectures for unicast sessions
We propose a measurement-based routing algorithm to load-balance intradomain traffic along multiple paths for multiple unicast sources. Multiple paths are established using overla...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
JPDC
2006
187views more  JPDC 2006»
13 years 9 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
ICOIN
2007
Springer
14 years 3 months ago
Balanced Multipath Source Routing
Abstract. We consider the problem of balancing the traffic load ideally over a wireless multihop network. In previous work, a systematic approach to this task was undertaken, start...
Shreyas Prasad, André Schumacher, Harri Haa...
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 9 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang