Sciweavers

262 search results - page 21 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 3 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
MONET
2006
103views more  MONET 2006»
14 years 9 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
15 years 3 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
15 years 1 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
15 years 3 months ago
Efficient Closed Contour Extraction from Range Image's Edge Points
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
Angel Domingo Sappa