Sciweavers

1491 search results - page 47 / 299
» Training Linear Discriminant Analysis in Linear Time
Sort
View
CVPR
2012
IEEE
13 years 5 days ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
RECOMB
2009
Springer
15 years 10 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
LATIN
2010
Springer
15 years 4 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
15 years 10 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
SDM
2008
SIAM
144views Data Mining» more  SDM 2008»
14 years 11 months ago
Active Learning with Model Selection in Linear Regression
Optimally designing the location of training input points (active learning) and choosing the best model (model selection) are two important components of supervised learning and h...
Masashi Sugiyama, Neil Rubens