2638 search results - page 119 / 528 » Random Geometric Complexes |
177
click to vote
TCS
1998
15 years 6 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
127
Voted
ISCAS
2007
IEEE
16 years 18 days ago
2007
IEEE
— This paper further investigates and answers two fundamental questions in the complex dynamical networks: i) how many nodes should a general complex dynamical network with fixe...
182
click to vote
FCT
2007
Springer
16 years 15 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
168
click to vote
NIPS
1996
15 years 7 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
152
click to vote
CC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...