Sciweavers

1127 search results - page 147 / 226
» New Algorithms for Generalized Network Flows
Sort
View
WG
2000
Springer
15 years 2 months ago
Networks with Small Stretch Number
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Serafino Cicerone, Gabriele Di Stefano
WWW
2008
ACM
15 years 11 months ago
Asymmetrical query recommendation method based on bipartite network resource allocation
This paper presents a new query recommendation method that generates recommended query list by mining large-scale user logs. Starting from the user logs of click-through data, we ...
Zhiyuan Liu, Maosong Sun
MOBICOM
2009
ACM
15 years 5 months ago
Order matters: transmission reordering in wireless networks
Modern wireless interfaces support a physical layer capability called Message in Message (MIM). Briefly, MIM allows a receiver to disengage from an ongoing reception, and engage ...
Justin Manweiler, Naveen Santhapuri, Souvik Sen, R...
ICDM
2007
IEEE
192views Data Mining» more  ICDM 2007»
15 years 5 months ago
Discovering Temporal Communities from Social Network Documents
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
Ding Zhou, Isaac G. Councill, Hongyuan Zha, C. Lee...
BROADNETS
2006
IEEE
15 years 5 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...