316 search results - page 37 / 64 » Genomic computing networks learn complex POMDPs |
GRC
2010
IEEE
13 years 8 months ago
2010
IEEE
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
IDEAL
2003
Springer
14 years 25 days ago
2003
Springer
As the complexity of Internet is scaled up, it is likely for the Internet resources to be exposed to Distributed Denial of Service (DDoS) flooding attacks on TCP-based Web servers....
CATE
2004
13 years 9 months ago
2004
Experience from the management of distributed computer-based learning resources in schools has been proven to be inefficient and costly. Though commercial software packages are av...
AAAI
2008
13 years 10 months ago
2008
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
ANCS
2008
ACM
13 years 9 months ago
2008
ACM
Over the last decade, programmable Network Processors (NPs) have become widely used in Internet routers and other network components. NPs enable rapid development of complex packe...