2969 search results - page 358 / 594 » A space efficient algorithm for group structure computation |
161
click to vote
MICCAI
2007
Springer
16 years 5 months ago
2007
Springer
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
131
click to vote
COMGEO
2008
ACM
15 years 5 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
154
click to vote
ICCAD
1995
IEEE
15 years 8 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
189
click to vote
TIFS
2008
15 years 4 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
148
click to vote
SMA
2009
ACM
15 years 11 months ago
2009
ACM
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...