Sciweavers

2173 search results - page 246 / 435
» On the Values of Reducibility Candidates
Sort
View
PADS
1998
ACM
15 years 10 months ago
Event History Based Sparse State Saving in Time Warp
This paper presents a sparse state saving scheme for Time Warp parallel discrete event simulation. The scheme bases the selection of the states to be recorded on the event history...
Francesco Quaglia
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 10 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....
ICSE
1998
IEEE-ACM
15 years 10 months ago
Reuse-Driven Interprocedural Slicing
Program slicing, a technique to compute the subset of program statements that can affect the value of a program variable at a specific program point, is widely used in tools to su...
Mary Jean Harrold, Ning Ci
KDD
1997
ACM
92views Data Mining» more  KDD 1997»
15 years 10 months ago
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
John M. Aronis, Foster J. Provost
ECRTS
2007
IEEE
15 years 10 months ago
The Space of EDF Feasible Deadlines
It is well known that the performance of computer controlled systems is heavily affected by delays and jitter occurring in the control loops, which are mainly caused by the interf...
Enrico Bini, Giorgio C. Buttazzo