Sciweavers

2228 search results - page 120 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
ICASSP
2010
IEEE
15 years 7 months ago
Clustering disjoint subspaces via sparse representation
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
Ehsan Elhamifar, René Vidal
GIS
2006
ACM
16 years 7 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
NIPS
2000
15 years 8 months ago
A Support Vector Method for Clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur, David Horn, Hava T. Siegelmann, Vladi...
SCHOLARPEDIA
2008
89views more  SCHOLARPEDIA 2008»
15 years 5 months ago
Support vector clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur
IPPS
2003
IEEE
16 years 5 hour ago
Effective Utilization and Reconfiguration of Distributed Hardware Resources Using Job Management Systems
Reconfigurable hardware resources are very expensive, and yet can be underutilized. This paper describes a middleware capable of discovering underutilized computing nodes with FPG...
Kris Gaj, Tarek A. El-Ghazawi, Nikitas A. Alexandr...