Sciweavers

2489 search results - page 281 / 498
» On the Subgroup Distance Problem
Sort
View
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
15 years 10 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
MM
2004
ACM
167views Multimedia» more  MM 2004»
15 years 9 months ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
15 years 9 months ago
Clustering time series from ARMA models with clipped data
Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. In this paper we focus on clustering...
Anthony J. Bagnall, Gareth J. Janacek
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 9 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 5 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...