Sciweavers

422 search results - page 79 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
TKDE
2010
195views more  TKDE 2010»
13 years 7 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
ICC
2007
IEEE
173views Communications» more  ICC 2007»
14 years 2 months ago
Virtual Topology Design for OBS Optical Networks
—Burst loss and delay are two main issues in optical hop-count. Network diameter is the hop-count of the shortest burst switching (OBS) networks. In OBS, if the hop-count path be...
Bin Wu, Kwan Lawrence Yeung
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...
FOCS
2005
IEEE
14 years 2 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
WWW
2009
ACM
14 years 9 months ago
An experimental study of large-scale mobile social network
Mobile social network is a typical social network where one or more individuals of similar interests or commonalities, conversing and connecting with one another using the mobile ...
Zheng-Bin Dong, Guo-Jie Song, Kun-Qing Xie, Jing-Y...