1729 search results - page 249 / 346 » Bound Graph Polysemy |
154
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
150
click to vote
SIGECOM
2006
ACM
15 years 12 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
168
click to vote
IWDC
2005
Springer
15 years 11 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
147
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
191
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...