150 search results - page 24 / 30 » Polynomial graph invariants from homomorphism numbers |
185
click to vote
WDAG
2007
Springer
16 years 24 days ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
145
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
165
click to vote
MFCS
2007
Springer
16 years 25 days ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
182
click to vote
WS
2006
ACM
16 years 19 days ago
2006
ACM
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
135
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...