Sciweavers

1497 search results - page 139 / 300
» A Computational Model for Message Passing
Sort
View
AUTOMATICA
2006
87views more  AUTOMATICA 2006»
13 years 8 months ago
Modeling continuous-time processes via input-to-state filters
A direct algorithm to estimate continuous-time ARMA (CARMA) models is proposed in this paper. In this approach, we first pass the observed data through an input-to-state filter an...
Kaushik Mahata, Minyue Fu
PODC
2009
ACM
14 years 3 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
SPAA
2009
ACM
14 years 3 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
ICASSP
2008
IEEE
14 years 2 months ago
Joint base-calling of two DNA sequences with factor graphs
—Automated estimation of DNA base-sequences is an important step in genomics and in many other emerging fields in biological and medical sciences. Current automated sequencers p...
Xiaomeng Shi, Desmond S. Lun, Jim Meldrim, Ralf K&...
FASE
2008
Springer
13 years 10 months ago
Regular Inference for State Machines Using Domains with Equality Tests
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
Therese Berg, Bengt Jonsson, Harald Raffelt