--- abstract: |- Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representation of probability distributions is central in term of computational efficiency in the field of probabilistic reasoning. The main problem arises when dealing with joint probability distributions over a set of random variables: they are always represented using huge probability arrays. In this paper, a new method based on a binary-tree representation is introduced in order to store efficiently very large joint distributions. Our approach approximates any multidimensional joint distributions using an adaptive discretization of the space. We make the assumption that the lower is the probability mass of a particular region of feature space, the larger is the discretization step. This assumption leads to a very optimized representation in term of time and memory. The other advantages of our approach are the ability to refine dynamically the distribution every time it is needed leading to a more accurate representation of the probability distribution and to an anytime representation of the distribution. altloc: [] chapter: ~ commentary: ~ commref: ~ confdates: Nov 3-5 2003 conference: 'International Conference on Tools for Artificial Intelligence - ICTAI 2003' confloc: Sacramento contact_email: ~ creators_id: [] creators_name: - family: Bellot given: D honourific: Dr lineage: '' - family: Bessiere given: P honourific: Dr lineage: '' date: 2003 date_type: published datestamp: 2004-08-10 department: ~ dir: disk0/00/00/37/52 edit_lock_since: ~ edit_lock_until: ~ edit_lock_user: ~ editors_id: [] editors_name: [] eprint_status: archive eprintid: 3752 fileinfo: /style/images/fileicons/application_pdf.png;/3752/1/Bellot03.pdf full_text_status: public importid: ~ institution: ~ isbn: ~ ispublished: pub issn: ~ item_issues_comment: [] item_issues_count: 0 item_issues_description: [] item_issues_id: [] item_issues_reported_by: [] item_issues_resolved_by: [] item_issues_status: [] item_issues_timestamp: [] item_issues_type: [] keywords: ~ lastmod: 2011-03-11 08:55:39 latitude: ~ longitude: ~ metadata_visibility: show note: ~ number: ~ pagerange: ~ pubdom: TRUE publication: ~ publisher: ~ refereed: FALSE referencetext: ~ relation_type: [] relation_uri: [] reportno: ~ rev_number: 12 series: ~ source: ~ status_changed: 2007-09-12 16:53:15 subjects: - comp-sci-robot succeeds: ~ suggestions: ~ sword_depositor: ~ sword_slug: ~ thesistype: ~ title: Approximate Discrete Probability Distribution Representation using a Multi-ResolutionBinary Tree type: confpaper userid: 4357 volume: ~