Sciweavers

5183 search results - page 124 / 1037
» The Complexity of Distributions
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
Distributed parameter estimation with selective cooperation
This paper proposes selective update and cooperation strategies for parameter estimation in distributed adaptive sensor networks. A setmembership filtering approach is employed t...
Stefan Werner, Yih-Fang Huang, Marcello L. R. de C...
CONCUR
2003
Springer
15 years 11 months ago
Synthesis of Distributed Algorithms Using Asynchronous Automata
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
Alin Stefanescu, Javier Esparza, Anca Muscholl
ICMCS
2000
IEEE
91views Multimedia» more  ICMCS 2000»
15 years 10 months ago
Distributed QoS Routing for Multimedia Traffic
The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algo...
Venkatesh Sarangan, Donna Ghosh, Raj Acharya
NETWORKING
2004
15 years 7 months ago
Improving Distributed Firewalls Performance through Vertical Load Balancing
In this paper we present an extension to an existing hash based packet classification technique in order to improve its performance in a distributed network access control environm...
Olivier Paul
ICML
1999
IEEE
16 years 7 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar