13784 search results - page 265 / 2757 » On Computing Functions with Uncertainty |
216
click to vote
AB
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Thoughts are spatio-temporal patterns of coalitions of firing neurons and their interconnections. Neural algebras represent these patterns as formal algebraic objects, a...
209
click to vote
ICIC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...
186
click to vote
LCN
2005
IEEE
16 years 24 days ago
2005
IEEE
— As Service Discovery Protocols (SDP) are becoming increasingly important for ubiquitous computing, they must behave according to predefined principles. We present the function...
181
click to vote
ACSC
2003
IEEE
16 years 15 days ago
2003
IEEE
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
208
click to vote
CIE
2010
Springer
16 years 20 hour ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...