ALENEX 2007 | Sciweavers

7

ALENEX
2004

116views Algorithms» more ALENEX 2004»

A Computational Framework for Handling Motion

13 years 6 months ago

We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algor...

Leonidas J. Guibas, Menelaos I. Karavelas, Daniel ...

claim paper

Read More »

16

click to vote

ALENEX
2004

107views Algorithms» more ALENEX 2004»

An Experimental Analysis of a Compact Graph Representation

13 years 6 months ago

Download www.cs.cmu.edu

In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...

Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash

claim paper

Read More »

11

click to vote

ALENEX
2004

107views Algorithms» more ALENEX 2004»

Approximating the Visible Region of a Point on a Terrain

13 years 6 months ago

Download cg.scs.carleton.ca

Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...

Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz

claim paper

Read More »

9

click to vote

ALENEX
2004

110views Algorithms» more ALENEX 2004»

Computation of a Class of COntinued Fraction Constants

13 years 6 months ago

Download algo.inria.fr

There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...

Loïck Lhote

claim paper

Read More »

13

click to vote

ALENEX
2004

99views Algorithms» more ALENEX 2004»

Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments

13 years 6 months ago

Download www.cs.utk.edu

d Abstract) Faisal N. Abu-Khzam , Rebecca L. Collins , Michael R. Fellows , Michael A. Langston , W. Henry Suters and Chris T. Symons

Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R...

claim paper

Read More »

14

click to vote

ALENEX
2007

126views Algorithms» more ALENEX 2007»

0/1 Vertex and Facet Enumeration with BDDs

13 years 6 months ago

Download www.mpi-inf.mpg.de

In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Anot...

Markus Behle, Friedrich Eisenbrand

claim paper

Read More »

8

click to vote

ALENEX
2007

127views Algorithms» more ALENEX 2007»

Intersection in Integer Inverted Indices

13 years 6 months ago

Download siam.org

Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...

Peter Sanders, Frederik Transier

claim paper

Read More »

7

click to vote

ALENEX
2007

86views Algorithms» more ALENEX 2007»

In Transit to Constant Time Shortest-Path Queries in Road Networks

13 years 6 months ago

Download algo2.iti.kit.edu

Holger Bast, Stefan Funke, Domagoj Matijevic, Pete...

claim paper

Read More »

17

click to vote

ALENEX
2007

158views Algorithms» more ALENEX 2007»

Faster Filters for Approximate String Matching

13 years 6 months ago

Download siam.org

We introduce a new ﬁltering method for approximate string matching called the suﬃx ﬁlter. It has some similarity with well-known ﬁltration algorithms, which we call factor...

Juha Kärkkäinen, Joong Chae Na

claim paper

Read More »

11

click to vote

ALENEX
2007

98views Algorithms» more ALENEX 2007»

Computing Visibility on Terrains in External Memory

13 years 6 months ago