Sciweavers

511 search results - page 97 / 103
» TSP with bounded metrics
Sort
View
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
14 years 2 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan
INFOCOM
2006
IEEE
14 years 2 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
IMC
2006
ACM
14 years 2 months ago
Fisher information of sampled packets: an application to flow size estimation
Packet sampling is widely used in network monitoring. Sampled packet streams are often used to determine flow-level statistics of network traffic. To date there is conflicting e...
Bruno F. Ribeiro, Donald F. Towsley, Tao Ye, Jean ...
MOBICOM
2006
ACM
14 years 2 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
ICRA
2005
IEEE
122views Robotics» more  ICRA 2005»
14 years 2 months ago
Supervised Learning of Places from Range Data using AdaBoost
— This paper addresses the problem of classifying places in the environment of a mobile robot into semantic categories. We believe that semantic information about the type of pla...
Óscar Martínez Mozos, Cyrill Stachni...