We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
A translation is a conversion from a source language into a target language preserving the meaning. A huge number of techniques and computational approaches have been experimented...
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...