Sciweavers

154 search results - page 17 / 31
» Algorithms for Implicit Hitting Set Problems
Sort
View
ICML
2006
IEEE
16 years 16 days ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li
CVPR
2005
IEEE
16 years 1 months ago
Particle Filtering for Geometric Active Contours with Application to Tracking Moving and Deforming Objects
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
Yogesh Rathi, Namrata Vaswani, Allen Tannenbaum, A...
CVPR
2008
IEEE
16 years 1 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán
PAMI
2011
14 years 6 months ago
Topology-Adaptive Mesh Deformation for Surface Evolution, Morphing, and Multiview Reconstruction
—Triangulated meshes have become ubiquitous discrete surface representations. In this paper, we address the problem of how to maintain the manifold properties of a surface while ...
Andrei Zaharescu, Edmond Boyer, Radu Horaud
ITSL
2008
15 years 1 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki