Sciweavers

712 search results - page 82 / 143
» A mixture model for random graphs
Sort
View
TSP
2008
101views more  TSP 2008»
13 years 7 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
NIPS
2008
13 years 9 months ago
Structure Learning in Human Sequential Decision-Making
We use graphical models and structure learning to explore how people learn policies in sequential decision making tasks. Studies of sequential decision-making in humans frequently...
Daniel Acuña, Paul R. Schrater
JMLR
2010
158views more  JMLR 2010»
13 years 2 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
TOMS
2010
106views more  TOMS 2010»
13 years 6 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
CSDA
2007
151views more  CSDA 2007»
13 years 7 months ago
Robust semiparametric mixing for detecting differentially expressed genes in microarray experiments
An important goal of microarray studies is the detection of genes that show significant changes in observed expressions when two or more classes of biological samples such as tre...
Marco Alfò, Alessio Farcomeni, Luca Tardell...