Sciweavers

CCR
2004
86views more  CCR 2004»
13 years 11 months ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
JSYML
2006
64views more  JSYML 2006»
13 years 11 months ago
Every 1-generic computes a properly 1-generic
Abstract. A real is called properly n-generic if it is n-generic but not n + 1generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m...
Barbara F. Csima, Rod Downey, Noam Greenberg, Deni...
JSS
2006
85views more  JSS 2006»
13 years 11 months ago
Effects of context on program slicing
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
Jens Krinke
MOR
2008
63views more  MOR 2008»
13 years 11 months ago
Domination Between Traffic Matrices
A traffic matrix D1 dominates a traffic matrix D2 if D2 can be routed on every (capacitated) network where D1 can be routed. We prove that D1 dominates D2 if and only if D1 , cons...
Gianpaolo Oriolo
APAL
2006
50views more  APAL 2006»
13 years 11 months ago
Imaginaries in real closed valued fields
The paper shows elimination of imaginaries for real closed valued fields to the geometric sorts which were introduced in the [6]. We also show that this result is in some sense op...
T. Mellor
DM
2008
110views more  DM 2008»
13 years 11 months ago
Nonrepetitive colorings of graphs of bounded tree-width
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
André Kündgen, Michael J. Pelsmajer
DM
2008
97views more  DM 2008»
13 years 11 months ago
(r, r+1)-factorizations of (d, d+1)-graphs
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...
Anthony J. W. Hilton
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 11 months ago
Distributed Kalman Filter via Gaussian Belief Propagation
Abstract--Recent result shows how to compute distributively and efficiently the linear MMSE for the multiuser detection problem, using the Gaussian BP algorithm. In the current wor...
Danny Bickson, Ori Shental, Danny Dolev
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 11 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...