Sciweavers

400 search results - page 10 / 80
» Subspace evasive sets
Sort
View
CVPR
2003
IEEE
14 years 9 months ago
Generalized Principal Component Analysis (GPCA)
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
René Vidal, Shankar Sastry, Yi Ma
NIPS
2007
13 years 9 months ago
Discriminative K-means for Clustering
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
Jieping Ye, Zheng Zhao, Mingrui Wu
ICPR
2006
IEEE
14 years 8 months ago
Car/Non-Car Classification in an Informative Sample Subspace
In this paper, we present a method for data classification with application to car/non-car objects. We first developed a sample based car/non-car maximal mutual information low di...
Guoping Qiu, Jianzhong Fang
TCS
2008
13 years 7 months ago
The supercover of an m-flat is a discrete analytical object
The aim of this paper is to show that the supercover of an m-flat (i.e. a Euclidean affine subspace of dimension m) in Euclidean n-space is a discrete analytical object. The super...
Eric Andres
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 9 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei