201 search results - page 26 / 41 » The Connectivity of addition Cayley graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alp...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
OSDI
2004
ACM
14 years 7 months ago
2004
ACM
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
OPODIS
2008
13 years 8 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
CN
2004
13 years 7 months ago
2004
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...