412 search results - page 42 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
96
Voted
IUI
2009
ACM
15 years 10 months ago
2009
ACM
The TaskTracer system allows knowledge workers to define a set of activities that characterize their desktop work. It then associates with each user-defined activity the set of ...
106
click to vote
ICPR
2002
IEEE
16 years 2 months ago
2002
IEEE
In this paper, we propose a new context-sensitive Bayesian learning algorithm. By modeling the distributions of data locations by a mixture of Gaussians, the new algorithm can uti...
132
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: One of the essential processing events during pre-mRNA maturation is the posttranscriptional addition of a polyadenine [poly(A)] tail. The 3'-end poly(A) track pr...
121
click to vote
ARTCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
118
click to vote
NIPS
2008
15 years 3 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...