Sciweavers

2173 search results - page 11 / 435
» On the Values of Reducibility Candidates
Sort
View
FSE
2010
Springer
132views Cryptology» more  FSE 2010»
14 years 5 days ago
Rebound Attack on Reduced-Round Versions of JH
Abstract. JH, designed by Wu, is one of the 14 second round candidates in the NIST Hash Competition. This paper presents the first analysis results of JH by using rebound attack. ...
Vincent Rijmen, Deniz Toz, Kerem Varici
TWC
2010
13 years 2 months ago
A Reduced-Complexity PTS-Based PAPR Reduction Scheme for OFDM Systems
In this paper, a reduced-complexity partial transmit sequences (PTS) scheme is proposed to resolve the intrinsic high peak-to-average power ratio (PAPR) problem of orthogonal frequ...
Sheng-Ju Ku, Chin-Liang Wang, Chiuan-Hsu Chen
ICCBR
2009
Springer
14 years 1 months ago
A Value Supplementation Method for Case Bases with Incomplete Information
Abstract. In this paper we present a method for supplementing incomplete cases with information from other cases within a case base. The acquisition of complete and correct cases i...
Kerstin Bach, Meike Reichle, Klaus-Dieter Althoff
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
14 years 1 months ago
On the approximate domain optimization of deterministic and expected value criteria
— We define the concept of approximate domain optimizer for deterministic and expected value optimization criteria. Roughly speaking, a candidate optimizer is an approximate dom...
Andrea Lecchini-Visintini, John Lygeros, Jan M. Ma...
FLAIRS
2003
13 years 8 months ago
An Improved Algorithm for Mining Association Rules Using Multiple Support Values
Almost all the approaches in association rule mining suggested the use of a single minimum support, technique that either rules out all infrequent itemsets or suffers from the bot...
Ioannis N. Kouris, Christos Makris, Athanasios K. ...