Sciweavers

2229 search results - page 321 / 446
» Comparative analysis of biclustering algorithms
Sort
View
AIPS
2003
13 years 11 months ago
A Framework for Planning in Continuous-time Stochastic Domains
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
Håkan L. S. Younes, David J. Musliner, Reid ...
3DOR
2009
13 years 11 months ago
SHREC 2009 - Shape Retrieval Contest
The objective of the Shape Retrieval Contest '09 (SHREC'09) of Partial Models is to compare the performances of algorithms that accept a range image as the query and ret...
Remco C. Veltkamp, Frank B. ter Haar
CVPR
2010
IEEE
13 years 10 months ago
A probabilistic framework for joint segmentation and tracking
Most tracking algorithms implicitly apply a coarse segmentation of each target object using a simple mask such as a rectangle or an ellipse. Although convenient, such coarse segme...
Chad Aeschliman, Johnny Park, Avinash C. Kak
CSDA
2007
105views more  CSDA 2007»
13 years 10 months ago
Calculation of simplicial depth estimators for polynomial regression with applications
A fast algorithm for calculating the simplicial depth of a single parameter vector of a polynomial regression model is derived. Additionally, an algorithm for calculating the para...
R. Wellmann, S. Katina, Ch. H. Müller
JIIS
2006
103views more  JIIS 2006»
13 years 10 months ago
Time-focused clustering of trajectories of moving objects
Spatio-temporal, geo-referenced datasets are growing rapidly, and will be more in the near future, due to both technological and social/commercial reasons. From the data mining vie...
Mirco Nanni, Dino Pedreschi