Sciweavers

164 search results - page 4 / 33
» On k-Anonymity and the Curse of Dimensionality
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
Identification of MISO nonlinear systems via the semiparametric approach
In this paper we examine a class of multiple-input, singleoutput (MISO) nonlinear systems of the block-oriented structure. In particular, we focus on MISO Hammerstein systems bein...
Jiaqing Lv, Miroslaw Pawlak
APWEB
2010
Springer
13 years 8 months ago
Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
Henning Köhler, Jing Yang
DASFAA
2005
IEEE
120views Database» more  DASFAA 2005»
13 years 11 months ago
A New Indexing Method for High Dimensional Dataset
Indexing high dimensional datasets has attracted extensive attention from many researchers in the last decade. Since R-tree type of index structures are known as suffering “curse...
Jiyuan An, Yi-Ping Phoebe Chen, Qinying Xu, Xiaofa...
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
14 years 6 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
PCM
2004
Springer
99views Multimedia» more  PCM 2004»
13 years 10 months ago
Indexing Issues in Supporting Similarity Searching
Indexing issues that arise in the support of similarity searching are presented. This includes a discussion of the curse of dimensionality, as well as multidimensional indexing, di...
Hanan Samet