Sciweavers

14379 search results - page 2507 / 2876
» is 2000
Sort
View
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
179
Voted
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
15 years 8 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
SPIESR
2000
104views Database» more  SPIESR 2000»
15 years 8 months ago
Feature localization and search by object model under illumination change
Color object recognition methods that are based on image retrieval algorithms can handle changes of illumination via image normalization, e.g. simple color-channel-normalization1 ...
Mark S. Drew, Zinovi Tauber, Ze-Nian Li
SPIESR
2000
138views Database» more  SPIESR 2000»
15 years 8 months ago
Descriptor for spatial distribution of motion activity for compressed video
In this paper we present a new descriptor for spatial distribution of motion activity in video sequences. We construct a histogram of areas of distinct regions (or "blobs&quo...
Ajay Divakaran, Huifang Sun
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
« Prev « First page 2507 / 2876 Last » Next »