Sciweavers

485 search results - page 63 / 97
» Iterative Bounding LAO
Sort
View
IACR
2011
149views more  IACR 2011»
13 years 9 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
Ming Duan, Xuejia Lai
CORR
2012
Springer
249views Education» more  CORR 2012»
13 years 5 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
CVPR
2001
IEEE
16 years 5 days ago
Tracking and Modeling Non-Rigid Objects with Rank Constraints
This paper presents a novel solution for flow-based tracking and 3D reconstruction of deforming objects in monocular image sequences. A non-rigid 3D object undergoing rotation and...
Lorenzo Torresani, Danny B. Yang, Eugene J. Alexan...
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
15 years 10 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
15 years 5 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held