2512 search results - page 335 / 503 » Learning from Highly Structured Data by Decomposition |
134
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
149
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
153
Voted
SDM
2009
SIAM
16 years 28 days ago
2009
SIAM
As the amount of textual information grows explosively in various kinds of business systems, it becomes more and more desirable to analyze both structured data records and unstruc...
144
Voted
SMA
2008
ACM
15 years 3 months ago
2008
ACM
We present a framework for segmenting and storing filament networks from scalar volume data. Filament structures are commonly found in data generated using high-throughput microsc...
130
Voted
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper investigates the appearance manifold of facial expression: embedding image sequences of facial expression from the high dimensional appearance feature space to a low dim...