4714 search results - page 272 / 943 » The Complexity of Iterated Multiplication |
149
click to vote
SCALESPACE
2007
Springer
16 years 8 days ago
2007
Springer
This paper proposes an extension of compressed sensing that allows to express the sparsity prior in a dictionary of bases. This enables the use of the random sampling strategy of c...
132
click to vote
COMPGEOM
2006
ACM
16 years 3 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...
161
click to vote
ACIVS
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...
136
click to vote
PG
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we propose efficient numerical techniques for Butterworth filtering and implicit fairing of large irregular triangle meshes, where the corresponding filters are ...
157
Voted
ESOP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...