6249 search results - page 90 / 1250 » Topological Informational Spaces |
JCT
2006
13 years 9 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
AMC
2008
13 years 9 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
A visual representation of an object must meet at least three basic requirements. First, it must allow identification of the object in the presence of slight but unpredictable chan...
RECOMB
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. One phylogeny-based approach to horizontal gene transfer (HGT) detection entails comparing the topology of a gene tree to that of the species tree, and using their differ...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...