1449 search results - page 59 / 290 » Finiteness results for sigmoidal |
126
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
171
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
179
click to vote
CSDA
2007
15 years 6 months ago
2007
Variational methods for model comparison have become popular in the neural computing/machine learning literature. In this paper we explore their application to the Bayesian analys...
180
click to vote
LISP
2006
15 years 6 months ago
2006
We introduce a concrete semantics for floating-point operations which describes the propagation of roundoff errors throughout a calculation. This semantics is used to assert the co...
167
click to vote
AAECC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...