4212 search results - page 359 / 843 » On Compressible Pairings and Their Computation |
127
click to vote
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of...
141
Voted
ICPR
2002
IEEE
16 years 8 months ago
2002
IEEE
When performing hierarchical clustering, some metric must be used to determine the similarity between pairs of clusters. Traditional similarity metrics either can only deal with s...
141
click to vote
RECOMB
2008
Springer
16 years 7 months ago
2008
Springer
We report on a new algorithm for combining the information from several mass spectra of the same peptide. The algorithm automatically learns peptide fragmentation patterns, so that...
165
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
108
click to vote
CHI
2010
ACM
16 years 1 months ago
2010
ACM
In this paper we examine the Tongue Music project: a performance-instrumental that makes use of the human tongue to yield amorous sounds, either by solo using a primary tongue con...