Sciweavers

1434 search results - page 183 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
140
Voted
RECOMB
2005
Springer
16 years 2 months ago
Improved Duplication Models for Proteome Network Evolution
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
Gürkan Bebek, Petra Berenbrink, Colin Cooper,...
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
15 years 9 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
FSTTCS
2009
Springer
15 years 8 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
ICDCS
2007
IEEE
15 years 8 months ago
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C...
ICPP
2006
IEEE
15 years 8 months ago
Parallel Information Extraction on Shared Memory Multi-processor System
Text Mining is one of the best solutions for today and the future’s information explosion. With the development of modern processor technologies, it will be a mass market deskto...
Jiulong Shan, Yurong Chen, Qian Diao, Yimin Zhang