Sciweavers

2372 search results - page 193 / 475
» Probabilistic calling context
Sort
View
106
Voted
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 3 months ago
Asymptotic Traffic Flow in an Hyperbolic Network I: Definition and Properties of the Core
In this work we study the asymptotic traffic behaviour for Gromov's hyperbolic networks as the size of the network increases. We prove that under certain mild hypothesis the t...
Yuliy Baryshnikov, Gabriel H. Tucci
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 3 months ago
LACK - a VoIP Steganographic Method
The paper presents a new steganographic method called LACK (Lost Audio PaCKets Steganography) which is intended mainly for VoIP. The method is presented in a broader context of net...
Wojciech Mazurczyk, Józef Lubacz
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
15 years 3 months ago
On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups
This note deals with a formula due to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symmetric grou...
Stephan G. Wagner
104
Voted
IJAC
2008
58views more  IJAC 2008»
15 years 3 months ago
Symplectic Alternating Algebras
This paper begins the development of a theory of what we will call symplectic alternating algebras. They have arisen in the study of 2-Engel groups but seem also to be of interest...
Gunnar Traustason
IPL
2007
78views more  IPL 2007»
15 years 3 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...