Sciweavers

2996 search results - page 71 / 600
» Numberings and Randomness
Sort
View
CSFW
2010
IEEE
15 years 9 months ago
On Protection by Layout Randomization
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programming-language terms. More specifically, we consider ...
Martín Abadi, Gordon D. Plotkin
CORR
2010
Springer
74views Education» more  CORR 2010»
15 years 5 months ago
A note on the random greedy triangle-packing algorithm
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
Tom Bohman, Alan M. Frieze, Eyal Lubetzky
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
15 years 4 months ago
Short Cycles in Random Regular Graphs
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
130
Voted
CEC
2005
IEEE
15 years 10 months ago
Investigating the effect of random noise on the evolution of colour terms
Abstract- The effect of adding noise to an expressioninduction model of language evolution was investigated. The model consisted of a number of artificial people who were able to i...
Mike Dowman
132
Voted
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 9 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...