Sciweavers

900 search results - page 119 / 180
» Design of a Robust Search Algorithm for P2P Networks
Sort
View
JSAC
2006
199views more  JSAC 2006»
13 years 8 months ago
IDES: An Internet Distance Estimation Service for Large Networks
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...
Yun Mao, Lawrence K. Saul, Jonathan M. Smith
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 2 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
CIKM
2003
Springer
14 years 1 months ago
Content-based retrieval in hybrid peer-to-peer networks
Hybrid peer-to-peer architectures use special nodes to provide directory services for regions of the network (“regional directory services”). Hybrid peer-to-peer architectures...
Jie Lu, James P. Callan
JMLR
2006
131views more  JMLR 2006»
13 years 8 months ago
Incremental Support Vector Learning: Analysis, Implementation and Applications
Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM ...
Pavel Laskov, Christian Gehl, Stefan Krüger, ...
CONEXT
2010
ACM
13 years 6 months ago
ICTCP: Incast Congestion Control for TCP in data center networks
TCP incast congestion happens in high-bandwidth and lowlatency networks, when multiple synchronized servers send data to a same receiver in parallel [15]. For many important data ...
Haitao Wu, Zhenqian Feng, Chuanxiong Guo, Yongguan...