126 search results - page 7 / 26 » Finding minimal bases in arbitrary spline spaces |
ROBVIS
2001
Springer
15 years 2 months ago
2001
Springer
This paper presents a wavelet-based algorithm for height from gradients. The tensor product of the third-order Daubechies’ scaling functions is used to span the solution space. ...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
113
click to vote
PAMI
2006
14 years 9 months ago
2006
We present a novel variational and statistical approach for shape registration. Shapes of interest are implicitly embedded in a higher dimensional space of distance transforms. In...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
79
Voted
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...