8499 search results - page 1569 / 1700 » cans 2009 |
159
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
168
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
181
click to vote
PAM
2009
Springer
16 years 1 months ago
2009
Springer
Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihomi...
174
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
172
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...