Sciweavers

339 search results - page 55 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
ICDCN
2011
Springer
14 years 1 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
ISBI
2007
IEEE
15 years 3 months ago
Real-Time Mutual-Information-Based Linear Registration on the Cell Broadband Engine Processor
Emerging multi-core processors are able to accelerate medical imaging applications by exploiting the parallelism available in their algorithms. We have implemented a mutual-inform...
Moriyoshi Ohara, Hangu Yeo, Frank Savino, Giridhar...
MIDDLEWARE
2005
Springer
15 years 3 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
DATE
2009
IEEE
125views Hardware» more  DATE 2009»
15 years 4 months ago
On linewidth-based yield analysis for nanometer lithography
— Lithographic variability and its impact on printability is a major concern in today’s semiconductor manufacturing process. To address sub-wavelength printability, a number of...
Aswin Sreedhar, Sandip Kundu
ISORC
2000
IEEE
15 years 2 months ago
TCP Throughput and Buffer Management
There have been many debates about the feasibility of providing guaranteed Quality of Service (QoS) when network traffic travels beyond the enterprise domain and into the vast unk...
Todd Lizambri, Fernando Duran, Shukri Wakid