996 search results - page 79 / 200 » A general method to speed up fixed-parameter-tractable algor... |
156
click to vote
TC
2010
15 years 3 months ago
2010
—The most pervasive compute operation carried out in almost all bioinformatics applications is pairwise sequence homology detection (or sequence alignment). Due to exponentially ...
155
click to vote
ALT
2003
Springer
16 years 1 months ago
2003
Springer
In this paper, we present a kernel trick embedded Gaussian Mixture Model (GMM), called kernel GMM. The basic idea is to embed kernel trick into EM algorithm and deduce a parameter ...
156
click to vote
PPOPP
2012
ACM
14 years 6 days ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
160
click to vote
PKDD
2000
Springer
15 years 8 months ago
2000
Springer
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
147
Voted
ROBOCUP
2009
Springer
15 years 11 months ago
2009
Springer
In this article a method is proposed for ball tracking using 100 Hz computer vision in a semi-automated foosball table. In this application the behavior of the ball is highly dynam...