Sciweavers

2304 search results - page 395 / 461
» On the Vulnerability of Large Graphs
Sort
View
178
Voted
WAE
2001
281views Algorithms» more  WAE 2001»
15 years 2 months ago
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
David A. Bader, Ajith K. Illendula, Bernard M. E. ...
90
Voted
USS
2004
15 years 2 months ago
Static Disassembly of Obfuscated Binaries
Disassembly is the process of recovering a symbolic representation of a program's machine code instructions from its binary representation. Recently, a number of techniques h...
Christopher Krügel, William K. Robertson, Fre...
90
Voted
WSC
1998
15 years 2 months ago
Windows-based Animation with PROOF
Proof AnimationTM is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, midsize...
James O. Henriksen
109
Voted
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 2 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
80
Voted
WSC
1997
15 years 2 months ago
The Power and Performance of Proof Animation
Proof Animation™ 4.0 is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, mi...
James O. Henriksen