Sciweavers

89 search results - page 9 / 18
» A Critique of the Valiant Model
Sort
View
SPAA
1994
ACM
14 years 1 months ago
An Optical Simulation of Shared Memory
We present a work-optimal randomized algorithm for simulating a shared memory machine (pram) on an optical communication parallel computer (ocpc). The ocpc model is motivated by t...
Leslie Ann Goldberg, Yossi Matias, Satish Rao
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
14 years 1 months ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir
BC
2006
105views more  BC 2006»
13 years 10 months ago
A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks
Recruitment learning in hierarchies is an inherently unstable process (Valiant, 1994). This paper presents conditions on parameters for a feedforward network to ensure stable recru...
Cengiz Günay, Anthony S. Maida
JMLR
2002
89views more  JMLR 2002»
13 years 9 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
ICCS
2001
Springer
14 years 2 months ago
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation
This paper surveys and places into perspective a number of results concerning the D-BSP (Decomposable Bulk Synchronous Parallel) model of computation, a variant of the popular BSP ...
Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietrac...