Sciweavers

6251 search results - page 165 / 1251
» Randomness, Computability, and Density
Sort
View
120
Voted
AAAI
2008
15 years 6 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 1 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat
ISSTA
2007
ACM
15 years 5 months ago
Experimental assessment of random testing for object-oriented software
Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
HPDC
2010
IEEE
15 years 4 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
NIPS
2008
15 years 5 months ago
On Computational Power and the Order-Chaos Phase Transition in Reservoir Computing
Randomly connected recurrent neural circuits have proven to be very powerful models for online computations when a trained memoryless readout function is appended. Such Reservoir ...
Benjamin Schrauwen, Lars Buesing, Robert A. Legens...