Sciweavers

1529 search results - page 147 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
PASTE
1998
ACM
15 years 8 months ago
Efficient Composite Data Flow Analysis Applied to Concurrent Programs
FLAVERS, a tool for verifying properties of concurrent systems, uses composite data flow analysis to incrementally improve the precision of the results of its verifications. Altho...
Gleb Naumovich, Lori A. Clarke, Leon J. Osterweil
PODS
2001
ACM
190views Database» more  PODS 2001»
16 years 4 months ago
On the Effects of Dimensionality Reduction on High Dimensional Similarity Search
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
Charu C. Aggarwal
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 6 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 5 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICASSP
2010
IEEE
15 years 4 months ago
Adaptive search for sparse targets with informative priors
ACT This works considers the problem of efficient energy allocation of resources in a continuous fashion in determining the location of targets in a sparse environment. We extend ...
Gregory Newstadt, Eran Bashan, Alfred O. Hero III