1802 search results - page 33 / 361 » Complexity Theory for Operators in Analysis |
146
click to vote
PCI
2001
Springer
15 years 9 months ago
2001
Springer
Formal modeling of complex systems is a non-trivial task, especially if a formal method does not facilitate separate development of the components of a system. This paper describes...
124
click to vote
ESANN
2007
15 years 6 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
143
click to vote
ESOP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...
139
click to vote
PKC
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
175
click to vote
SEFM
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...