Sciweavers

1081 search results - page 133 / 217
» Working with the LR Degrees
Sort
View
92
Voted
GIS
1999
ACM
15 years 5 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
83
Voted
ALT
1998
Springer
15 years 5 months ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...
114
Voted
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 5 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
137
Voted
MICRO
1997
IEEE
141views Hardware» more  MICRO 1997»
15 years 4 months ago
Unroll-and-Jam Using Uniformly Generated Sets
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
Steve Carr, Yiping Guan
89
Voted
INFOCOM
1996
IEEE
15 years 4 months ago
Maintaining High Throughput during Overload in ATM Switches
This report analyzes two popular heuristics for ensuring packet integrity in ATM switching systems. In particular, we analyze the behavior of packet tail discarding, in order to u...
Jonathan S. Turner