Sciweavers

2479 search results - page 312 / 496
» Random Event Structures
Sort
View
AMAI
2005
Springer
15 years 2 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
133
Voted
CORR
2004
Springer
118views Education» more  CORR 2004»
15 years 2 months ago
Understanding Search Trees via Statistical Physics
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
TON
2002
175views more  TON 2002»
15 years 2 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
121
Voted
MVA
2007
158views Computer Vision» more  MVA 2007»
15 years 2 months ago
Hybrid object labelling in digital images
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
Julio Martín-Herrero
129
Voted
SPRINGSIM
2010
15 years 27 days ago
Using factored bond graphs for distributed diagnosis of physical systems
This paper presents a distributed Bayesian fault diagnosis scheme for physical systems. Our diagnoser design is based on a procedure for factoring the global system bond graph (BG...
Indranil Roychoudhury, Gautam Biswas, Xenofon D. K...