Sciweavers

688 search results - page 74 / 138
» Computing with subspaces
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
Linear Laplacian Discrimination for Feature Extraction
Discriminant feature extraction plays a fundamental role in pattern recognition. In this paper, we propose the Linear Laplacian Discrimination (LLD) algorithm for discriminant fea...
Deli Zhao, Zhouchen Lin, Rong Xiao, Xiaoou Tang
ICDE
2002
IEEE
164views Database» more  ICDE 2002»
15 years 11 months ago
Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
Charu C. Aggarwal
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 1 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
KDD
2012
ACM
181views Data Mining» more  KDD 2012»
13 years 4 days ago
On "one of the few" objects
Objects with multiple numeric attributes can be compared within any “subspace” (subset of attributes). In applications such as computational journalism, users are interested i...
You Wu, Pankaj K. Agarwal, Chengkai Li, Jun Yang 0...
CVPR
2004
IEEE
15 years 11 months ago
Efficient Tracking with the Bounded Hough Transform
The Bounded Hough Transform is introduced to track objects in a sequence of sparse range images. The method is based upon a variation of the General Hough Transform that exploits ...
Michael A. Greenspan, Limin Shang, Piotr Jasiobedz...