Results 11 to 20 of about 81,087 (166)

On the probabilistic min spanning tree Problem [PDF]

, 2010
International audienceWe study a probabilistic optimization model for min spanning tree, where any vertex v i of the input-graph G(V, E) has some presence probability p i in the final instance G′ ⊂ G that will effectively be optimized.
Paschos, V.T., V. T. Paschos, Cécile Murat, Nicolas Boria, MURAT, Cécile, C. Murat, Vangelis Th Paschos, Vangelis Paschos, Paschos, Vangelis, Boria, Nicolas, Murat, C.   +10 more
core   +1 more source

Representations of Infinite Tree Sets

, 2021
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.
J. Pascal Gollin, Kneip, J
core   +1 more source

Set Theory

, 2011
This stimulating workshop exposed some of the most exciting recent develops in set theory, including major new results about the proper forcing axiom, stationary reflection, gaps in P(ω)/Fin, iterated forcing, the tree property, ideals and colouring ...

core   +2 more sources

Approximation hardness of dominating set problems in bounded degree graphs

, 2008
We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka, Chlebik, M., Miroslav Chlebik (4461319), J Chlebíková (16079357), Chlebíková, J.   +4 more
core   +1 more source

Tree pattern matching from regular tree expressions [PDF]

, 2018
In this work we deal with tree pattern matching over ranked trees, where the pattern set to be matched against is defined by a regular tree expression.
Ziadi, Djelloul, Djelloul Ziadi, Cherroun, Hadda, Cleophas, Loek, Belabbaci, Ahlem, Loek Cleophas, Cleophas, Loek; id_orcid, Ahlem Belabbaci, Cleophas, Loek,, Hadda Cherroun   +9 more
core   +1 more source

Effects of growth rate, size, and light availability on tree survival across life stages: a demographic analysis accounting for missing values and small sample sizes. [PDF]

, 2015
The data set supporting the results of this article is available in the Dryad repository, http://dx.doi.org/10.5061/dryad.6f4qs. Moustakas, A. and Evans, M. R.
Moustakas, A, Evans, Matthew R., Moustakas, Aristides, Matthew R Evans, Evans, MR, Aristides Moustakas   +5 more
core   +1 more source

Implicit inequality constraints in a binary tree model [PDF]

, 2011
In this paper we investigate the geometry of a discrete Bayesian network whose graph is a tree all of whose variables are binary and the only observed variables are those labeling its leaves.
Zwiernik, Piotr, Piotr Zwiernik, Jim Q. Smith, Smith, J. Q.   +3 more
core   +1 more source

A novel attribute reduction algorithm based on peer-to-peer technique and rough set theory

, 2010
Rough Set theory is an effective tool to deal with vagueness and uncertainty information to select the most relevant attributes for a decision system. However, to find the minimum attributes is a NP-hard problem.
null Peng Wen, Wen, Peng, Ma, Guangzhi, null Yansheng Lu, Engmin Song, Song, Engmin, Guangzhi Ma, Lu, Yansheng   +7 more
core   +1 more source

Tree-Structured Multiple Description Coding for Multiview Mobile TV and Camera-Phone Networks [PDF]

, 2011
--- Since multiview video communications facilitate the selection of several camera views of a given scene, it may be deemed to be a promising technique for mobile television and camera-phone networks. Similar to conventional single-view video, multiview
Yongkai Huo, Hanzo, Lajos, Huo, Yongkai, Lajos Hanzo   +3 more
core   +1 more source

Tree compression pushdown automaton [PDF]

, 2012
summary:A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The
Janoušek, Jan, Melichar, Bořivoj, Poliak, Martin   +2 more
core   +1 more source