Sciweavers

2996 search results - page 299 / 600
» Numberings and Randomness
Sort
View
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
ICML
2004
IEEE
16 years 7 months ago
Sequential skewing: an improved skewing algorithm
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
Soumya Ray, David Page
PKC
2007
Springer
147views Cryptology» more  PKC 2007»
16 years 25 days ago
New Chosen-Ciphertext Attacks on NTRU
We present new and efficient key-recovery chosen-ciphertext attacks on NTRUencrypt. Our attacks are somewhat intermediate between chosen-ciphertext attacks on NTRUencrypt previousl...
Nicolas Gama, Phong Q. Nguyen
MABS
2000
Springer
15 years 10 months ago
Mapping the Envelope of Social Simulation Trajectories
Discovering and studying emergent phenomena are among the most important activities in social research. Replicating this phenomenon in "the lab" using simulation is an i...
Oswaldo Terán, Bruce Edmonds, Steve Wallis
FLAIRS
2004
15 years 8 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
Ying Feng, Robert L. Goldstone, Vladimir Menkov