Sciweavers

4451 search results - page 651 / 891
» On Random Ordering Constraints
Sort
View
SPAA
1998
ACM
15 years 10 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
STOC
1998
ACM
125views Algorithms» more  STOC 1998»
15 years 10 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
RIDE
1997
IEEE
15 years 10 months ago
Evaluation of Sampling for Data Mining of Association Rules
Discovery of association rules is a prototypical problem in data mining. The current algorithms proposed for data mining of association rules make repeated passes over the databas...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
SIGMOD
1997
ACM
180views Database» more  SIGMOD 1997»
15 years 10 months ago
Online Aggregation
Aggregation in traditional database systems is performed in batch mode: a query is submitted, the system processes a large volume of data over a long period of time, and, eventual...
Joseph M. Hellerstein, Peter J. Haas, Helen J. Wan...
ICCAD
1996
IEEE
151views Hardware» more  ICCAD 1996»
15 years 10 months ago
Expected current distributions for CMOS circuits
The analysis of CMOS VLSI circuit switching current has become an increasingly important and difficult task from both a VLSI design and simulation software perspective. This paper...
Dennis J. Ciplickas, Ronald A. Rohrer