Sciweavers

365 search results - page 68 / 73
» On the combinatorics of Galois numbers
Sort
View
TCS
2008
14 years 9 months ago
Computational self-assembly
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...
Pierre-Louis Curien, Vincent Danos, Jean Krivine, ...
73
Voted
DM
2000
89views more  DM 2000»
14 years 9 months ago
Some counting problems related to permutation groups
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
Peter J. Cameron
77
Voted
TOMS
2010
106views more  TOMS 2010»
14 years 8 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 7 months ago
Metric uniformization and spectral bounds for graphs
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
INFOCOM
2012
IEEE
12 years 12 months ago
Jointly optimal bit loading, channel pairing and power allocation for multi-channel relaying
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
Mahdi Hajiaghayi, Min Dong, Ben Liang