Sciweavers

840 search results - page 44 / 168
» Open multi-methods for c
Sort
View
257
Voted
SIGCOMM
2012
ACM
13 years 5 months ago
Abstractions for network update
ions for Network Update Mark Reitblatt Cornell Nate Foster Cornell Jennifer Rexford Princeton Cole Schlesinger Princeton David Walker Princeton Configuration changes are a common...
Mark Reitblatt, Nate Foster, Jennifer Rexford, Col...
115
Voted
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
15 years 1 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
163
Voted
DSD
2010
IEEE
221views Hardware» more  DSD 2010»
15 years 18 days ago
Modeling Reconfigurable Systems-on-Chips with UML MARTE Profile: An Exploratory Analysis
Reconfigurable FPGA based Systems-on-Chip (SoC) architectures are increasingly becoming the preferred solution for implementing modern embedded systems, due to their flexible natur...
Sana Cherif, Imran Rafiq Quadri, Samy Meftali, Jea...
125
Voted
TIT
2011
131views more  TIT 2011»
14 years 9 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
134
Voted
ICALP
2011
Springer
14 years 6 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner