Sciweavers

177 search results - page 16 / 36
» Uniform Hashing in Constant Time and Optimal Space
Sort
View
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
14 years 26 days ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
CC
2001
Springer
13 years 11 months ago
Goal-Directed Value Profiling
Compilers can exploit knowledge that a variable has a fixed known value at a program point for optimizations such as code specialization and constant folding. Recent work has shown...
Scott A. Watterson, Saumya K. Debray
TASLP
2008
176views more  TASLP 2008»
13 years 7 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney
GIS
2009
ACM
14 years 8 months ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
Hao Yuan, Mikhail J. Atallah
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 7 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...