Sciweavers

1798 search results - page 62 / 360
» A Tree for All Seasons
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
13 years 9 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
EOR
2006
66views more  EOR 2006»
13 years 8 months ago
Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
Sensitivity analyses have long been used to assess the impacts of uncertainties on outcomes of decision models. Several approaches have been suggested, but it has been problematic...
Jyri Mustajoki, Raimo P. Hämäläinen...
BMCBI
2004
181views more  BMCBI 2004»
13 years 8 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
DCG
2002
71views more  DCG 2002»
13 years 8 months ago
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
Richard P. Stanley, Jim Pitman
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan