1813 search results - page 107 / 363 » Calculi of Approximation Spaces |
142
click to vote
JAT
2007
15 years 6 months ago
2007
An irregular wavelet frame has the form W(ψ, Λ) = {a−1/2 ψ(x a − b)}(a,b)∈Λ, where ψ ∈ L2 (R) and Λ is an arbitrary sequence of points in the affine group A = R+ × ...
222
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
215
click to vote
WADS
2007
Springer
16 years 14 days ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
171
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
140
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...