5 citations · 8 across the 4 of their papers we have counts for
5 papers
Cellular Automata Simulation on FPGA for Training Neural Networks with Virtual World Imagery
Olivier Van Acker, Oded Lachish, Graeme Burnett
We present ongoing work on a tool that consists of two parts: (i) A raw micro-level abstract world simulator with an interface to (ii) a 3D game engine, translator of raw abstract…
Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs
Oded Lachish, Igor Razgon
In this paper we establish an exponential lower bound on the size of syntactic non-deterministic read -times branching programs for computing a class of mo…
Trading query complexity for sample-based testing and multi-testing scalability
Eldar Fischer, Oded Lachish, Yadu Vasudev
We show here that every non-adaptive property testing algorithm making a constant number of queries, over a fixed alphabet, can be converted to a sample-based (as per [Goldreich an…
Wiretapping a hidden network
Haris Aziz, Oded Lachish, Mike Paterson +1
We consider the problem of maximizing the probability of hitting a strategically chosen hidden virtual network by placing a wiretap on a single link of a communication network. Thi…
Spanning connectivity games
Haris Aziz, Oded Lachish, Mike Paterson +1
The Banzhaf index, Shapley-Shubik index and other voting power indices measure the importance of a player in a coalitional game. We consider a simple coalitional game called the sp…