Sciweavers

5100 search results - page 606 / 1020
» The Linear Complexity of a Graph
Sort
View
ICIP
2002
IEEE
16 years 8 months ago
Boosting face recognition on a large-scale database
Performance of many state-of-the-art face recognition (FR) methods deteriorates rapidly, when large in size databases are considered. In this paper, we propose a novel clustering ...
Juwei Lu, Konstantinos N. Plataniotis
ICML
2008
IEEE
16 years 7 months ago
On multi-view active learning and the combination with semi-supervised learning
Multi-view learning has become a hot topic during the past few years. In this paper, we first characterize the sample complexity of multi-view active learning. Under the expansion...
Wei Wang, Zhi-Hua Zhou
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
16 years 7 months ago
Computing Clusters of Correlation Connected Objects
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
Christian Böhm, Karin Kailing, Peer Krög...
ICCAD
2002
IEEE
152views Hardware» more  ICCAD 2002»
16 years 3 months ago
Efficient instruction encoding for automatic instruction set design of configurable ASIPs
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
Jong-eun Lee, Kiyoung Choi, Nikil Dutt
SACRYPT
2009
Springer
155views Cryptology» more  SACRYPT 2009»
16 years 1 months ago
Practical Collisions for SHAMATA-256
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream cipher-like hash function design with components of the AES, and it is one of the ...
Sebastiaan Indesteege, Florian Mendel, Bart Prenee...