Sciweavers

200 search results - page 37 / 40
» What Graphs can be Efficiently Represented by BDDs
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná
FAST
2010
13 years 10 months ago
Discovery of Application Workloads from Network File Traces
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
Neeraja J. Yadwadkar, Chiranjib Bhattacharyya, K. ...
CVPR
2009
IEEE
15 years 2 months ago
Active Volume Models for 3D Medical Image Segmentation
In this paper, we propose a novel predictive model for object boundary, which can integrate information from any sources. The model is a dynamic “object” model whose manifes...
Tian Shen (Lehigh University), Hongsheng Li (Lehig...
ISI
2006
Springer
13 years 7 months ago
Tracing the Event Evolution of Terror Attacks from On-Line News
Since the September 11th terror attack at New York in 2001, the frequency of terror attacks around the world has been increasing and it draws more attention of the public. On Janua...
Christopher C. Yang, Xiaodong Shi, Chih-Ping Wei