Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IACR
2011
209views more  IACR 2011»
11 years 1 months ago
Improved Attacks on Full GOST
GOST is a well known block cipher which was developed in the Soviet Union during the 1970’s as an alternative to the US-developed DES. In spite of considerable cryptanalytic eff...
Itai Dinur, Orr Dunkelman, Adi Shamir
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
11 years 1 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
RTAS
2011
IEEE
11 years 4 months ago
Maximizing Contention-Free Executions in Multiprocessor Scheduling
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
Jinkyu Lee, Arvind Easwaran, Insik Shin
CIKM
2010
Springer
12 years 11 days ago
Document allocation policies for selective searching of distributed indexes
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
Anagha Kulkarni, Jamie Callan
GECCO
2008
Springer
142views Optimization» more  GECCO 2008»
12 years 2 months ago
Complexity of Max-SAT using stochastic algorithms
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
Mohamed Qasem, Adam Prügel-Bennett
ECML
1998
Springer
12 years 6 months ago
A Monotonic Measure for Optimal Feature Selection
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
Huan Liu, Hiroshi Motoda, Manoranjan Dash
ISCIS
2009
Springer
12 years 6 months ago
Calculating the VC-dimension of decision trees
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
Ozlem Asian, Olcay Taner Yildiz, Ethem Alpaydin
FSE
2003
Springer
207views Cryptology» more  FSE 2003»
12 years 7 months ago
Analysis of RMAC
In this paper the newly proposed RMAC system is analysed and a generic attack is presented. The attack can be used to find one of the two keys in the system faster than by an exh...
Lars R. Knudsen, Tadayoshi Kohno
KR
2004
Springer
12 years 7 months ago
Discovering State Invariants
We continue to advocate a methodology that we used earlier for pattern discovery through exhaustive search in selected small domains. This time we apply it to the problem of disco...
Fangzhen Lin
SSC
2007
Springer
140views Cryptology» more  SSC 2007»
12 years 7 months ago
Existence of Modular Sonar Sequences of Twin-Prime Product Length
In this paper, we investigate the existence of modular sonar sequences of length v and mod v where v is a product of twin primes. For v = 3 · 5 = 15, we have found some old and ne...
Sung-Jun Yoon, Hong-Yeop Song
books