Sciweavers

831 search results - page 60 / 167
» Coalgebraic Correspondence Theory
Sort
View
ENTCS
2008
99views more  ENTCS 2008»
14 years 12 months ago
Specifying Properties of Concurrent Computations in CLF
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
Kevin Watkins, Iliano Cervesato, Frank Pfenning, D...
TWC
2008
131views more  TWC 2008»
14 years 11 months ago
Asymptotic Ergodic Capacity of Multidimensional Vector-Sensor Array MIMO Channels
Abstract--We analyze asymptotic ergodic capacity of multidimensional vector-sensor array MIMO (PMD-MIMO) channels established by the use of dual-polarized antennas in the form of 1...
Özgür Ertug
ADCM
2000
45views more  ADCM 2000»
14 years 11 months ago
Training neural networks with noisy data as an ill-posed problem
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...
Martin Burger, Heinz W. Engl
COMBINATORICS
1998
130views more  COMBINATORICS 1998»
14 years 11 months ago
Codes and Projective Multisets
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
Stefan M. Dodunekov, Juriaan Simonis
RSA
2010
118views more  RSA 2010»
14 years 10 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem