2168 search results - page 162 / 434 » Randomized Algorithms and Complexity Theory |
131
click to vote
COLT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
141
Voted
JUCS
2006
15 years 3 months ago
2006
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
124
Voted
COCO
2010
Springer
15 years 7 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
150
click to vote
ALT
2003
Springer
16 years 13 days ago
2003
Springer
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
157
Voted
PROPERTYTESTING
2010
15 years 1 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...