Sciweavers

1632 search results - page 153 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
NIPS
2004
15 years 5 months ago
Joint Probabilistic Curve Clustering and Alignment
Clustering and prediction of sets of curves is an important problem in many areas of science and engineering. It is often the case that curves tend to be misaligned from each othe...
Scott Gaffney, Padhraic Smyth
CVPR
2010
IEEE
16 years 7 days ago
Clustering Dynamic Textures with the Hierarchical EM Algorithm
The dynamic texture (DT) is a probabilistic generative model, defined over space and time, that represents a video as the output of a linear dynamical system (LDS). The DT model ...
Antoni Chan, Emanuele Coviello, Gert Lanckriet
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 8 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
113
Voted
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
15 years 8 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
ICASSP
2009
IEEE
15 years 10 months ago
Time-space-sequential algorithms for distributed Bayesian state estimation in serial sensor networks
We consider distributed estimation of a time-dependent, random state vector based on a generally nonlinear/non-Gaussian state-space model. The current state is sensed by a serial ...
Ondrej Hlinka, Franz Hlawatsch