2430 search results - page 245 / 486 » Computing Tutte Polynomials |
252
click to vote
POPL
2006
ACM
16 years 4 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
126
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
127
click to vote
PERCOM
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
113
click to vote
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
126
click to vote
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...