1187 search results - page 172 / 238 » The Generalized Dimensionality Reduction Problem |
113
click to vote
NETWORKS
2011
14 years 19 days ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
SIGGRAPH
1998
ACM
15 years 2 months ago
1998
ACM
We present a method that uses measured scene radiance and global illumination in order to add new objects to light-based models with correct lighting. The method uses a high dynam...
126
click to vote
MICCAI
2000
Springer
15 years 1 months ago
2000
Springer
We present a novel approach to statistical shape analysis of anatomical structures based on small sample size learning techniques. The high complexity of shape models used in medic...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
108
click to vote
EGH
2011
Springer
13 years 9 months ago
2011
Springer
Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphi...