129 search results - page 25 / 26 » Lower Bounds of Computational Power of a Synaptic Calculus |
109
Voted
MP
2010
14 years 10 months ago
2010
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
90
Voted
STOC
1998
ACM
15 years 3 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
106
Voted
ALT
2004
Springer
15 years 8 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
96
Voted
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
94
Voted
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...