Sciweavers

167 search results - page 31 / 34
» On the complexity and approximation of syntenic distance
Sort
View
AFRIGRAPH
2003
ACM
13 years 11 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 7 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
CVPR
2004
IEEE
14 years 9 months ago
MetaMorphs: Deformable Shape and Texture Models
We present a new class of deformable models, MetaMorphs, whose formulation integrates both shape and interior texture. The model deformations are derived from both boundary and re...
Xiaolei Huang, Dimitris N. Metaxas, Ting Chen
ECCV
2002
Springer
14 years 9 months ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec
ICML
2004
IEEE
14 years 8 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...