Sciweavers

16430 search results - page 683 / 3286
» On Computable Tree Functions
Sort
View
JSC
2006
95views more  JSC 2006»
15 years 7 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
FUIN
2007
108views more  FUIN 2007»
15 years 7 months ago
Local Properties of Triangular Graphs
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
Antoni W. Mazurkiewicz
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
15 years 5 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
TCIAIG
2010
15 years 2 months ago
Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing
Monte-Carlo tree search has recently been very successful for game playing particularly for games where the evaluation of a state is difficult to compute, such as Go or General Gam...
Jean Méhat, Tristan Cazenave
ICPR
2000
IEEE
16 years 8 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes