Sciweavers

3162 search results - page 304 / 633
» Transformations for semi-continuous data
Sort
View
CONPAR
1992
15 years 10 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault
CAV
2009
Springer
165views Hardware» more  CAV 2009»
15 years 10 months ago
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the fu...
Sven Verdoolaege, Gerda Janssens, Maurice Bruynoog...
AI
2006
Springer
15 years 10 months ago
On the Performance of Chernoff-Distance-Based Linear Dimensionality Reduction Techniques
Abstract. We present a performance analysis of three linear dimensionality reduction techniques: Fisher's discriminant analysis (FDA), and two methods introduced recently base...
Mohammed Liakat Ali, Luis Rueda, Myriam Herrera
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 9 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
ICISC
2007
120views Cryptology» more  ICISC 2007»
15 years 7 months ago
Improving the Time Complexity of Matsui's Linear Cryptanalysis
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
Baudoin Collard, François-Xavier Standaert,...