Sciweavers

2799 search results - page 349 / 560
» computing 1998
Sort
View
CPE
1998
Springer
80views Hardware» more  CPE 1998»
15 years 8 months ago
Probability, Parallelism and the State Space Exploration Problem
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
DAS
1998
Springer
15 years 8 months ago
Group 4 Compressed Document Matching
Numerous approaches, including textual, structural and featural, to detecting duplicate documents have been investigated. Considering document images are usually stored and transm...
Dar-Shyang Lee, Jonathan J. Hull
DEXA
1998
Springer
124views Database» more  DEXA 1998»
15 years 8 months ago
Indexing Time-Series Databases for Inverse Queries
Abstract. In this paper we examine the problem of indexing time sequences in order to answer inverse queries. An inverse query computes all the time points at which the sequence co...
Alexandros Nanopoulos, Yannis Manolopoulos
SIGMOD
1998
ACM
129views Database» more  SIGMOD 1998»
15 years 8 months ago
Incremental Distance Join Algorithms for Spatial Databases
Two new spatial join operations, distance join and distance semijoin, are introduced where the join output is ordered by the distance betweenthe spatialattribute values ofthe join...
Gísli R. Hjaltason, Hanan Samet
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 8 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....