Sciweavers

11211 search results - page 1804 / 2243
» Data Structures
Sort
View
ISKO
1997
49views more  ISKO 1997»
15 years 8 months ago
Frontiers in Conceptual Navigation
This paper was prepared for a lecture at a recent meeting of the German Chapter of ISKO devoted to Wissensorganisation mit Multimedialen Techniken [Knowledge Organization with Mul...
Kim H. Veltman
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
15 years 8 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
224
Voted
SPLC
2000
15 years 8 months ago
Development/maintenance/reuse: software evolution in product lines
The evolution tree model is a two-dimensional model that describes how the versions of the artifacts of a software product evolve. The propagation graph is a data structure that c...
Stephen R. Schach, Amir Tomer
165
Voted
WSC
1997
15 years 8 months ago
Creating a Flexible, Simulation-Based Finite Scheduling Tool
Today's business climate for manufacturers requires low inventory, quick response systems that turn out a wide variety of products. Since many companies are reaching physical...
Barbara W. Mazziotti, Richard E. Horne Jr.
CCCG
1993
15 years 8 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
« Prev « First page 1804 / 2243 Last » Next »