Sciweavers

6575 search results - page 144 / 1315
» Specializing visualization algorithms
Sort
View
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 10 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
TSP
2008
124views more  TSP 2008»
15 years 6 months ago
Dictionary Preconditioning for Greedy Algorithms
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
Karin Schnass, Pierre Vandergheynst
DATESO
2009
101views Database» more  DATESO 2009»
15 years 4 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
INDOCRYPT
2003
Springer
15 years 11 months ago
Analysis of Non-fortuitous Predictive States of the RC4 Keystream Generator
The RC4 stream cipher is the most widely used software based stream cipher. It is based on a secret internal state of N = 256 bytes and two pointers. This paper proposes an efficie...
Souradyuti Paul, Bart Preneel
CDES
2008
87views Hardware» more  CDES 2008»
15 years 7 months ago
Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...