1458 search results - page 239 / 292 » Monads for incremental computing |
113
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
145
click to vote
ISCA
2010
IEEE
15 years 9 months ago
2010
IEEE
Over the past decade there has been a surge of academic and industrial interest in optimistic concurrency, i.e. the speculative parallel execution of code regions that have the se...
141
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
118
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper we propose an approach to control design of nonlinear time–delay systems, which is based on the construction of symbolic models, where each symbolic state and e...
125
click to vote
ECML
2001
Springer
15 years 8 months ago
2001
Springer
We present a powerful meta-clustering technique called Iterative Double Clustering (IDC). The IDC method is a natural extension of the recent Double Clustering (DC) method of Slon...