Sciweavers

455 search results - page 61 / 91
» Asynchronous and deterministic objects
Sort
View
AUTOMATICA
2006
122views more  AUTOMATICA 2006»
13 years 8 months ago
Gibbs sampler-based coordination of autonomous swarms
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
Wei Xi, Xiaobo Tan, John S. Baras
FGCS
2006
91views more  FGCS 2006»
13 years 8 months ago
Dynamic provisioning of LightPath services for radio astronomy applications
A demonstration at iGRID 2005 used dynamic, deterministic, and dedicated LightPath network services to link radio telescopes from around the world with computational facilities at...
Jerry Sobieski, Tom Lehman, Bijan Jabbari, Chester...
NETWORKS
2008
13 years 7 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
ICIP
2010
IEEE
13 years 5 months ago
Gaussian mixture models for spots in microscopy using a new split/merge em algorithm
In confocal microscopy imaging, target objects are labeled with fluorescent markers in the living specimen, and usually appear as spots in the observed images. Spot detection and ...
Kangyu Pan, Anil C. Kokaram, Jens Hillebrand, Mani...
CTRSA
2011
Springer
189views Cryptology» more  CTRSA 2011»
12 years 11 months ago
Online Ciphers from Tweakable Blockciphers
Abstract. Online ciphers are deterministic length-preserving permutations EK : ({0, 1}n )+ → ({0, 1}n )+ where the i-th block of ciphertext depends only on the first i blocks of...
Phillip Rogaway, Haibin Zhang