Sciweavers

5115 search results - page 386 / 1023
» On Randomized Lanczos Algorithms
Sort
View
INFOCOM
2007
IEEE
16 years 1 months ago
Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
Yunfeng Lin, Ben Liang, Baochun Li
216
Voted
AAAI
2008
15 years 9 months ago
ARMOR Security for Los Angeles International Airport
Security at major locations of economic or political importance is a key concern around the world, particularly given the threat of terrorism. Limited security resources prevent f...
James Pita, Manish Jain, Fernando Ordó&ntil...
205
Voted
INFOCOM
2011
IEEE
14 years 11 months ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews
277
Voted
MOBIHOC
2012
ACM
13 years 10 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
JMLR
2012
13 years 10 months ago
Age-Layered Expectation Maximization for Parameter Learning in Bayesian Networks
The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitat...
Avneesh Singh Saluja, Priya Krishnan Sundararajan,...