1081 search results - page 5 / 217 » Working with the LR Degrees |
DAGSTUHL
2006
13 years 11 months ago
2006
We introduce different mobile network applications and show to which degree the concept of database transactions is required within the applications. We show properties of transact...
COMBINATORICS
2007
13 years 9 months ago
2007
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...
COLING
1990
13 years 11 months ago
1990
This paper describes the general architecture of generation in the ACORDproject. The central module of this architecture is a planning component, which allows to plan single sente...
GLOBECOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—In this work, we prove that a positive secure degree of freedom is achievable for a large class of real Gaussian channels as long as the channel is not degraded and the channel ...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...