Sciweavers

124 search results - page 23 / 25
» Efficient Algorithms for Conditional Independence Inference
Sort
View
SBBD
2004
119views Database» more  SBBD 2004»
13 years 9 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
SIAMIS
2010
378views more  SIAMIS 2010»
13 years 2 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
PSB
2004
13 years 9 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini
AMAI
1999
Springer
13 years 7 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
UAI
2008
13 years 9 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...