Sciweavers

11395 search results - page 1877 / 2279
» Beyond computer science
Sort
View
MFCS
2009
Springer
15 years 11 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
GD
2001
Springer
15 years 11 months ago
Orthogonal Drawings of Plane Graphs without Bends
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki
IWVF
2001
Springer
15 years 11 months ago
Minimum-Length Polygons in Approximation Sausages
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
Tetsuo Asano, Yasuyuki Kawamura, Reinhard Klette, ...
ICNP
2000
IEEE
15 years 11 months ago
Dynamic Internet Overlay Deployment and Management Using the X-Bone
The X-Bone dynamically deploys and manages Internet overlays to reduce con®guration e€ort and increase network component sharing. The X-Bone discovers, con®gures, and monitors ...
Joseph D. Touch
VISUALIZATION
2000
IEEE
15 years 11 months ago
Mastering interactive virtual Bronchioscopy on a Low-end PC
Virtual endoscopy presents the cross-sectional acquired 3D-data of a computer tomograph as an endoluminal view. The common approach for the visualization of a virtual endoscopy is...
Anna Vilanova, Balint Hegedüs, Eduard Grö...
« Prev « First page 1877 / 2279 Last » Next »