Sciweavers

361 search results - page 42 / 73
» acm 1993
Sort
View
COMPGEOM
1993
ACM
14 years 4 days ago
Worst-Case Bounds for Subadditive Geometric Graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
Marshall W. Bern, David Eppstein
SIGGRAPH
1993
ACM
14 years 4 days ago
On the form factor between two polygons
Form factors are used in radiosity to describe the fraction of diffusely reflected light leaving one surface and arriving at another. They are a fundamental geometric property us...
Peter Schröder, Pat Hanrahan
VLDB
1993
ACM
152views Database» more  VLDB 1993»
14 years 3 days ago
Declustering Objects for Visualization
In this paper we propose a new declustering method which is particularly suitable for image and cartographic databases used for visualization. Our declustering method is based on ...
Ling Tony Chen, Doron Rotem
VLDB
1993
ACM
138views Database» more  VLDB 1993»
14 years 3 days ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
14 years 4 days ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts