Sciweavers

2814 search results - page 328 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
CORR
2002
Springer
118views Education» more  CORR 2002»
13 years 10 months ago
Unsupervised discovery of morphologically related words based on orthographic and semantic similarity
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to di...
Marco Baroni, Johannes Matiasek, Harald Trost
SIMULATION
2010
178views more  SIMULATION 2010»
13 years 5 months ago
Application-level Simulation for Network Security
We introduce and describe a novel network simulation tool called NeSSi (Network Security Simulator). NeSSi incorporates a variety of features relevant to network security distingu...
Stephan Schmidt, Rainer Bye, Joël Chinnow, Ka...
PPOPP
2011
ACM
13 years 1 months ago
Cooperative reasoning for preemptive execution
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
PODC
2009
ACM
14 years 11 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
SPAA
2010
ACM
13 years 11 months 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