Sciweavers

1275 search results - page 160 / 255
» time 1998
Sort
View
JUCS
2007
122views more  JUCS 2007»
13 years 8 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
COMGEO
2002
ACM
13 years 8 months ago
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
Siu-Wing Cheng, Kam-Hing Lee
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
13 years 8 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
ALIFE
1998
13 years 8 months ago
The Perfect C. elegans Project: An Initial Report
The soil nematode Caenorhabditis Elegans (C. elegans) is the most investigated of all multi-cellular organisms. Since the proposal to use it as a model organism, a series of resea...
Hiroaki Kitano, Shugo Hamahashi, Sean Luke
CGF
1998
127views more  CGF 1998»
13 years 8 months ago
Getting Rid of Links in Hierarchical Radiosity
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
Marc Stamminger, Hartmut Schirmacher, Philipp Slus...