Sciweavers

164 search results - page 22 / 33
» On k-Anonymity and the Curse of Dimensionality
Sort
View
EDBT
2008
ACM
132views Database» more  EDBT 2008»
15 years 9 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
CVPR
2003
IEEE
15 years 11 months ago
Simultaneous Feature Selection and Classifier Training via Linear Programming: A Case Study for Face Expression Recognition
A linear programming technique is introduced that jointly performs feature selection and classifier training so that a subset of features is optimally selected together with the c...
Guodong Guo, Charles R. Dyer
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
15 years 10 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu
73
Voted
DAC
2003
ACM
15 years 10 months ago
Support vector machines for analog circuit performance representation
The use of Support Vector Machines (SVMs) to represent the performance space of analog circuits is explored. In abstract terms, an analog circuit maps a set of input design parame...
Fernando De Bernardinis, Michael I. Jordan, Albert...
ICML
2006
IEEE
15 years 10 months ago
Learning high-order MRF priors of color images
In this paper, we use large neighborhood Markov random fields to learn rich prior models of color images. Our approach extends the monochromatic Fields of Experts model (Roth &...
Alex J. Smola, Julian John McAuley, Matthias O. Fr...