Sciweavers

17329 search results - page 184 / 3466
» Improved non-approximability results
Sort
View
WOSS
2004
ACM
14 years 3 months ago
An extensible framework for autonomic analysis and improvement of distributed deployment architectures
A distributed software system’s deployment architecture can have a significant impact on the system’s properties, which depend on various system parameters, such as network ba...
Sam Malek, Marija Mikic-Rakic, Nenad Medvidovic
ICDAR
2003
IEEE
14 years 3 months ago
An Improved Parallel Thinning Algorithm
This paper describes an improved thinning algorithm for binary images. We improve thinning algorithm from the fundamental properties such as connectivity, onepixel width, robust t...
Lei Huang, Genxun Wan, Changping Liu
ISCAS
2003
IEEE
96views Hardware» more  ISCAS 2003»
14 years 3 months ago
A novel improvement technique for high-level test synthesis
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
Saeed Safari, Hadi Esmaeilzadeh, Amir-Hossein Jaha...
FSE
2010
Springer
220views Cryptology» more  FSE 2010»
14 years 2 months ago
Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutations. Our new cryptanalysis technique uses the fact that one can view two rounds ...
Henri Gilbert, Thomas Peyrin
CAAN
2007
Springer
14 years 2 months ago
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
Dirk Richter, Boris Goldengorin, Gerold Jäger...