Sciweavers

5981 search results - page 234 / 1197
» time 2006
Sort
View
APAL
2006
72views more  APAL 2006»
15 years 7 months ago
Constructive algebraic integration theory
For a long time people have been trying to develop probability theory starting from `finite' events rather than collections of infinite events. In this way one can find natura...
Bas Spitters
APAL
2006
76views more  APAL 2006»
15 years 7 months ago
Non-primitive recursive decidability of products of modal logics with expanding domains
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
David Gabelaia, Agi Kurucz, Frank Wolter, Michael ...
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 7 months ago
Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element
The running maximum-minimum (MAX-MIN) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time seri...
Daniel Lemire
DELTA
2006
IEEE
16 years 1 months ago
Some Common Aspects of Design Validation, Debug and Diagnosis
— Design, Verification and Test of integrated circuits with millions of gates put strong requirements on design time, test volume, test application time, test speed and diagnost...
Talal Arnaout, Gunter Bartsch, Hans-Joachim Wunder...
COMPGEOM
2006
ACM
16 years 1 months ago
How slow is the k-means method?
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
David Arthur, Sergei Vassilvitskii