Sciweavers

473 search results - page 50 / 95
» Local Search in Unstructured Networks
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 12 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
BMCBI
2007
202views more  BMCBI 2007»
14 years 10 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
IPPS
2008
IEEE
15 years 4 months ago
Random choices for churn resilient load balancing in peer-to-peer networks
Peer-to-peer (P2P) networks based on consistent hashing functions have an inherent load uneven distribution problem. Things are even worse in unstructured P2P systems. The objecti...
Song Fu, Cheng-Zhong Xu, Haiying Shen
CN
2006
61views more  CN 2006»
14 years 10 months ago
Structuring topologically aware overlay networks using domain names
Abstract-- Overlay networks are application layer systems which facilitate users in performing distributed functions such as searches over the contents of other users. An important...
Demetrios Zeinalipour-Yazti, Vana Kalogeraki
HICSS
2007
IEEE
91views Biometrics» more  HICSS 2007»
15 years 4 months ago
Immigrants and the Job Search: Comparing the Internet to Other Paths to Jobs
Highly educated immigrants face many barriers to employment in Canada, especially in acquiring jobs at the same level as those they had held prior to migration. This exploratory s...
Arent Greve, Janet W. Salaff, Elic Chan