495 search results - page 71 / 99 » Sparse representation algorithms based on mean-field approxi... |
130
click to vote
TKDE
2012
13 years 15 days ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
CGF
2007
14 years 10 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
SMA
1999
ACM
15 years 2 months ago
1999
ACM
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
MICCAI
2000
Springer
15 years 1 months ago
2000
Springer
New medical imaging modalities offering multi-valued data, such as phase contrast MRA and diffusion tensor MRI, require general representations for the development of automatized a...