Sciweavers

60 search results - page 2 / 12
» Compact Representation of Sets of Binary Constraints
Sort
View
UAI
1998
13 years 9 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...
CP
2009
Springer
14 years 8 months ago
Evaluation of Length-Lex Set Variables
This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier wo...
Justin Yip, Pascal Van Hentenryck
ECSQARU
2007
Springer
14 years 1 months ago
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
Norbert Lehmann
ICA
2007
Springer
13 years 11 months ago
Compact Representations of Market Securities Using Smooth Component Extraction
Independent Component Analysis (ICA) is a statistical method for expressing an observed set of random vectors as a linear combination of statistically independent components. This...
Hariton Korizis, Nikolaos Mitianoudis, Anthony G. ...
ICIP
1999
IEEE
14 years 9 months ago
Representing and Retrieving Regions Using Binary Partition Trees
This paper discusses the interest of Binary Partition Trees for image and region representation in the context of indexing and similarity based retrieval. Binary Partition Trees c...
Luis Garrido, Philippe Salembier, Josep R. Casas