Sciweavers

2463 search results - page 90 / 493
» Rankings of Directed Graphs
Sort
View
IOR
2011
107views more  IOR 2011»
13 years 4 months ago
Information Collection on a Graph
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
Ilya O. Ryzhov, Warren B. Powell
FCT
2009
Springer
14 years 1 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
SIAMJO
2011
13 years 4 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
INLG
2010
Springer
13 years 7 months ago
A Discourse-Aware Graph-Based Content-Selection Framework
This paper presents an easy-to-adapt, discourse-aware framework that can be utilized as the content selection component of a generation system whose goal is to deliver descriptive...
Seniz Demir, Sandra Carberry, Kathleen F. McCoy
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 9 months ago
Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
L. Wyatt Alverson II, Robert G. Donnelly, Scott J....