Sciweavers

4781 search results - page 503 / 957
» Online algorithms for network design
Sort
View
ICANN
1997
Springer
15 years 10 months ago
Local Subspace Classifier
Subsystems for on-line recognition of handwriting are needed in personal digital assistants (PDAs) and other portable handheld devices. We have developed a recognition system whic...
Jorma Laaksonen
AAAI
2010
15 years 8 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
ICDCN
2009
Springer
16 years 1 months ago
Flooding-Assisted Threshold Assignment for Aggregate Monitoring in Sensor Networks
The research community has witnessed a large interest in monitoring large scale distributed systems. In these applications typically we wish to monitor a global system condition wh...
Ali Abbasi, Ahmad Khonsari, Mohammad Sadegh Talebi
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
15 years 11 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
SRDS
2010
IEEE
15 years 4 months ago
Fault-Tolerant Aggregation for Dynamic Networks
Data aggregation is a fundamental building block of modern distributed systems. Averaging based approaches, commonly designated gossip-based, are an important class of aggregation ...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...