Sciweavers

1497 search results - page 219 / 300
» A Computational Model for Message Passing
Sort
View

Book
392views
16 years 10 months ago
Squeak by Example
"The book helps you get started with A Quick Tour of Squeak and guides you through A First Application. The Smalltalk language is introduced in three chapters on Syntax in a N...
Andrew P. Black, Stéphane Ducasse, Oscar Nierstra...
JNW
2007
78views more  JNW 2007»
14 years 11 months ago
A Delay Constrained Minimum Hop Distributed Routing Algorithm using Adaptive Path Prediction
Abstract— We propose a new delay-constrained minimumhop distributed routing algorithm (DCMH) for unicastrouting. DCMH uses a novel path feasibility prediction (PFP) model that is...
Azizul R. Mohd. Shariff, Michael E. Woodward
JOC
2007
84views more  JOC 2007»
14 years 11 months ago
Concurrent Composition of Secure Protocols in the Timing Model
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
SPAA
2010
ACM
15 years 2 days ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
IMR
2004
Springer
15 years 5 months ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso