1257 search results - page 36 / 252 » A generalization of Euler's constant |
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
106
click to vote
STOC
2004
ACM
16 years 3 days ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
119
click to vote
CSREAESA
2006
15 years 1 months ago
2006
- In recent years, there has been a rapid and wide spread proliferation of non-traditional embedded computing platforms such as digital camcorders, cellular phones, and portable me...
101
click to vote
SIAMDM
2008
14 years 11 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
103
click to vote
FOCS
1997
IEEE
15 years 4 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...