Sciweavers

1272 search results - page 183 / 255
» The Set Cover with Pairs Problem
Sort
View
ICCV
2007
IEEE
15 years 8 days ago
Articulated Shape Matching Using Locally Linear Embedding and Orthogonal Alignment
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
CICLING
2009
Springer
14 years 11 months ago
Improved Unsupervised Name Discrimination with Very Wide Bigrams and Automatic Cluster Stopping
We cast name discrimination as a problem in clustering short contexts. Each occurrence of an ambiguous name is treated independently, and represented using second?order context vec...
Ted Pedersen
ICPR
2010
IEEE
14 years 5 months ago
Recognizing Sign Language from Brain Imaging
The problem of classifying complex motor activities from brain imaging is relatively new territory within the fields of neuroscience and brain-computer interfaces. We report posi...
Nishant Mehta, Thad Starner, Melody Moore Jackson,...
PKDD
2000
Springer
107views Data Mining» more  PKDD 2000»
14 years 1 months ago
Expert Constrained Clustering: A Symbolic Approach
Abstract. A new constrained model is discussed as a way of incorporating efficiently a priori expert knowledge into a clustering problem of a given individual set. The first innova...
Fabrice Rossi, Frédérick Vautrain
SDM
2007
SIAM
112views Data Mining» more  SDM 2007»
13 years 11 months ago
PoClustering: Lossless Clustering of Dissimilarity Data
Given a set of objects V with a dissimilarity measure between pairs of objects in V , a PoCluster is a collection of sets P ⊂ powerset(V ) partially ordered by the ⊂ relation ...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...