Sciweavers

1692 search results - page 6 / 339
» A Dynamic Network Interdiction Problem
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
Dynamic index coding for wireless broadcast networks
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
Michael J. Neely, Arash Saber Tehrani, Zhen Zhang
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 3 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
IPSN
2003
Springer
14 years 1 months ago
Maximum Mutual Information Principle for Dynamic Sensor Query Problems
In this paper we study a dynamic sensor selection method for Bayesian filtering problems. In particular we consider the distributed Bayesian Filtering strategy given in [1] and sh...
Emre Ertin, John W. Fisher, Lee C. Potter
CORR
2011
Springer
172views Education» more  CORR 2011»
12 years 12 months ago
Uncovering the Temporal Dynamics of Diffusion Networks
Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision ...
Manuel Gomez-Rodriguez, David Balduzzi, Bernhard S...
NETWORKS
2008
13 years 8 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani