2593 search results - page 144 / 519 » Algorithms and Data Structures for Computer Topology |
127
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
171
click to vote
ISMB
1993
15 years 6 months ago
1993
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
150
Voted
CVPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new in...
151
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose a variational bayes approach to the problem of robust estimation of gaussian mixtures from noisy input data. The proposed algorithm explicitly takes into account the un...
176
Voted
NIPS
2007
15 years 6 months ago
2007
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...