Sciweavers

817 search results - page 105 / 164
» Exact solutions to linear programming problems
Sort
View
ICRA
2006
IEEE
125views Robotics» more  ICRA 2006»
14 years 1 months ago
Optimal Information Propagation in Sensor Networks
Abstract— This paper studies the effect of communicationlink weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to age...
Peng Yang, Randy A. Freeman, Kevin M. Lynch
NETWORKS
2006
13 years 7 months ago
A bidirected generalization of network matrices
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
Gautam Appa, Balázs Kotnyek
FUIN
2010
143views more  FUIN 2010»
13 years 5 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
GLOBECOM
2006
IEEE
14 years 1 months ago
Algorithms for Server Placement in Multiple-Description-Based Media Streaming
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
Satyajeet Ahuja, Marwan Krunz
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
13 years 8 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg