Sciweavers

3678 search results - page 717 / 736
» On the Stable Paths Problem
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
PODC
2010
ACM
14 years 1 months ago
Optimal gradient clock synchronization in dynamic networks
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rote...
GLOBECOM
2007
IEEE
14 years 1 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
GLOBECOM
2007
IEEE
14 years 1 months ago
Joint Traffic Blocking and Routing Under Network Failures and Maintenances
Under device failures and maintenance activities, network resources reduce and congestion may arise inside networks. As a result, users experience degraded performance on packet d...
Chao Liang, Zihui Ge, Yong Liu
AINA
2004
IEEE
14 years 1 months ago
Mobile IPv6 Extensions to support Nested Mobile Networks
Unlike host mobility support, network mobility is concerned with situations where an entire network changes its point of attachment to the Internet. Furthermore, we should conside...
ZhiJun Gu, Dongmin Yang, Cheeha Kim