Sciweavers

993 search results - page 131 / 199
» The Complexity of Probabilistic EL
Sort
View
DMDW
2001
91views Management» more  DMDW 2001»
13 years 9 months ago
On Estimating the Cardinality of Aggregate Views
Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. While the warehouse is under development and data are not a...
Paolo Ciaccia, Matteo Golfarelli, Stefano Rizzi
FLAIRS
2001
13 years 9 months ago
A Practical Markov Chain Monte Carlo Approach to Decision Problems
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
Timothy Huang, Yuriy Nevmyvaka
NIPS
2001
13 years 9 months ago
Grammatical Bigrams
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
Mark A. Paskin
AI
2008
Springer
13 years 8 months ago
Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
Di Wu, Xenofon D. Koutsoukos
BMCBI
2008
93views more  BMCBI 2008»
13 years 8 months ago
Ranking single nucleotide polymorphisms by potential deleterious effects
Identifying single nucleotide polymorphisms (SNPs) that are responsible for common and complex diseases such as cancer is of major interest in current molecular epidemiology. Howe...
Phil Hyoun Lee, Hagit Shatkay