Sciweavers

1941 search results - page 44 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
MP
2006
88views more  MP 2006»
14 years 9 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
ECCC
2006
134views more  ECCC 2006»
14 years 9 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
TSP
2010
14 years 4 months ago
Design of regular wavelets using a three-step lifting scheme
We propose structural multidimensional multi-channel filter banks with desirable numbers of vanishing moments for the analysis and synthesis banks. For a two-channel filter bank, w...
Ramin Eslami, Hayder Radha
INFOCOM
2005
IEEE
15 years 3 months ago
Packetostatics: deployment of massively dense sensor networks as an electrostatics problem
— We investigate the spatial distribution of wireless nodes that can transport a given volume of traffic in a sensor network, while requiring the minimum number of wireless node...
Stavros Toumpis, Leandros Tassiulas
VR
2010
IEEE
154views Virtual Reality» more  VR 2010»
14 years 8 months ago
On error bound estimation for motion prediction
A collaborative virtual environment (CVE) allows remote users to access and modify shared data through networks, such as the Internet. However, when the users are connected via th...
Rynson W. H. Lau, Kenneth Lee