Sciweavers

982 search results - page 141 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
DATE
2009
IEEE
131views Hardware» more  DATE 2009»
15 years 7 months ago
Communication minimization for in-network processing in body sensor networks: A buffer assignment technique
—Body sensor networks are emerging as a promising platform for healthcare monitoring. These systems are composed of battery-operated embedded devices which process physiological ...
Hassan Ghasemzadeh, Nisha Jain, Marco Sgroi, Roozb...
92
Voted
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick
90
Voted
WEA
2009
Springer
111views Algorithms» more  WEA 2009»
15 years 7 months ago
A Heuristic for Fair Correlation-Aware Resource Placement
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
Raouf Boutaba, Martin Karsten, Maxwell Young
101
Voted
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
15 years 4 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint
111
Voted
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
14 years 11 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang