Sciweavers

231 search results - page 28 / 47
» Computational experience with exterior point algorithms for ...
Sort
View
ICCV
2007
IEEE
14 years 8 months ago
Articulated Shape Matching by Robust Alignment of Embedded Representations
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
CIS
2008
Springer
13 years 8 months ago
Cooperation Controlled Competitive Learning Approach for Data Clustering
Rival Penalized Competitive Learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although t...
Tao Li, Wenjiang Pei, Shao-ping Wang, Yiu-ming Che...
JMLR
2012
11 years 9 months ago
Age-Layered Expectation Maximization for Parameter Learning in Bayesian Networks
The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitat...
Avneesh Singh Saluja, Priya Krishnan Sundararajan,...
ICDE
2007
IEEE
205views Database» more  ICDE 2007»
14 years 8 months ago
Multi-source Skyline Query Processing in Road Networks
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...
Ke Deng, Xiaofang Zhou, Heng Tao Shen
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 27 days ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...