Sciweavers

879 search results - page 125 / 176
» Designing Closer to the Edge
Sort
View
TON
2008
119views more  TON 2008»
13 years 8 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
CCR
2004
86views more  CCR 2004»
13 years 8 months ago
On the scaling of congestion in the internet graph
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Aditya Akella, Shuchi Chawla, Arvind Kannan, Srini...
COR
2008
142views more  COR 2008»
13 years 8 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
TVCG
2008
167views more  TVCG 2008»
13 years 7 months ago
Optimal Surface Parameterization Using Inverse Curvature Map
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
Yong-Liang Yang, Junho Kim, Feng Luo 0002, Shi-Min...
CISS
2010
IEEE
13 years 15 days ago
Self-organizing Dynamic Fractional Frequency Reuse on the uplink of OFDMA systems
Reverse link (or uplink) performance of cellular systems is becoming increasingly important with the emergence of new uplink-bandwidth intensive applications such as Video Share [...
Balaji Rengarajan, Alexander L. Stolyar, Harish Vi...