Sciweavers

815 search results - page 35 / 163
» Approximate Entropy Reducts
Sort
View
JUCS
2002
131views more  JUCS 2002»
14 years 11 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
CIVR
2009
Springer
108views Image Analysis» more  CIVR 2009»
15 years 6 months ago
High-entropy layouts for content-based browsing and retrieval
Multimedia browsing and retrieval systems can use dimensionality reduction methods to map from high-dimensional content-based feature distributions to low-dimensional layout space...
Ruixuan Wang, Stephen J. McKenna, Junwei Han
CVPR
2005
IEEE
16 years 1 months ago
Rank-R Approximation of Tensors: Using Image-as-Matrix Representation
We present a novel multilinear algebra based approach for reduced dimensionality representation of image ensembles. We treat an image as a matrix, instead of a vector as in tradit...
Hongcheng Wang, Narendra Ahuja
ICDE
2008
IEEE
155views Database» more  ICDE 2008»
16 years 1 months ago
Lattice Histograms: a Resilient Synopsis Structure
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
Panagiotis Karras, Nikos Mamoulis
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
15 years 1 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov