Sciweavers

184 search results - page 25 / 37
» Efficiently handling feature redundancy in high-dimensional ...
Sort
View
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
14 years 7 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
CVPR
2007
IEEE
14 years 9 months ago
Element Rearrangement for Tensor-Based Subspace Learning
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 9 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
ICCV
2009
IEEE
15 years 20 days ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu
ICDAR
1995
IEEE
13 years 11 months ago
Representation and classification of complex-shaped printed regions using white tiles
There is an increasingly pressing need to develop document analysis methods that are able to cope with images of documents containing printed regions of complex shapes. Contrary t...
Apostolos Antonacopoulos, R. T. Ritchings