Sciweavers

383 search results - page 46 / 77
» A Bound on the Total Chromatic Number
Sort
View
TASE
2008
IEEE
13 years 10 months ago
Sensor Selection in Arbitrary Dimensions
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
Volkan Isler, Malik Magdon-Ismail
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 11 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
14 years 2 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
INFOCOM
2008
IEEE
14 years 4 months ago
A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks
—We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means...
Zheng Wang, Hamid R. Sadjadpour, J. J. Garcia-Luna...
DCC
2008
IEEE
14 years 10 months ago
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 a me...
Satyajeet Ahuja, Marwan Krunz