Sciweavers

526 search results - page 71 / 106
» Improved Decomposition of STGs
Sort
View
SADM
2008
178views more  SADM 2008»
13 years 9 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
ICCV
2009
IEEE
15 years 2 months ago
Sparsity Induced Similarity Measure for Label Propagation
Graph-based semi-supervised learning has gained considerable interests in the past several years thanks to its effectiveness in combining labeled and unlabeled data through labe...
Hong Cheng, Zicheng Liu, Jie Yang
DAC
2009
ACM
14 years 11 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...
WWW
2008
ACM
14 years 10 months ago
Enhanced hierarchical classification via isotonic smoothing
Hierarchical topic taxonomies have proliferated on the World Wide Web [5, 18], and exploiting the output space decompositions they induce in automated classification systems is an...
Kunal Punera, Joydeep Ghosh
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
14 years 10 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...