Sciweavers

74 search results - page 7 / 15
» Trapezoid Graphs and Generalizations, Geometry and Algorithm...
Sort
View
COCOA
2008
Springer
13 years 8 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
EDBT
2012
ACM
257views Database» more  EDBT 2012»
11 years 9 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 6 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
13 years 12 months ago
PCG: a foothold selection algorithm for spider robot locomotion in 2D tunnels
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
Amir Shapiro, Elon Rimon
IEEECGIV
2005
IEEE
14 years 9 days ago
A Practical Implementation of a 3-D Game Engine
Creating a 3-D game engine is not a trivial task as gamers often demand for high quality output with top notch performance in games. In this paper, we show you how various real-ti...
Thomas C. S. Cheah, Kok-Why Ng