Sciweavers

1529 search results - page 197 / 306
» A slant removal algorithm
Sort
View
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
14 years 2 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
GBRPR
2005
Springer
14 years 2 months ago
Pyramids of n-Dimensional Generalized Maps
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
Carine Grasset-Simon, Guillaume Damiand, Pascal Li...
ESA
2004
Springer
132views Algorithms» more  ESA 2004»
14 years 2 months ago
Seeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
Raghav Kulkarni, Meena Mahajan
ICRA
2003
IEEE
118views Robotics» more  ICRA 2003»
14 years 2 months ago
Capturing a convex object with three discs
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
Jeff Erickson, Shripad Thite, Fred Rothganger, Jea...
SC
2003
ACM
14 years 2 months ago
Handling Heterogeneity in Shared-Disk File Systems
We develop and evaluate a system for load management in shared-disk file systems built on clusters of heterogeneous computers. The system generalizes load balancing and server pr...
Changxun Wu, Randal C. Burns