5981 search results - page 234 / 1197 » time 2006 |
177
click to vote
APAL
2006
15 years 6 months ago
2006
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...
160
click to vote
APAL
2006
15 years 6 months ago
2006
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
140
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
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...
139
click to vote
DELTA
2006
IEEE
16 years 17 days ago
2006
IEEE
— 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...
141
click to vote
COMPGEOM
2006
ACM
16 years 14 days ago
2006
ACM
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...