7259 search results - page 1246 / 1452 » From Fields to Trees |
154
click to vote
JCSS
2010
15 years 5 months ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
183
click to vote
JOT
2010
15 years 5 months ago
2010
In self-adaptive systems components are dynamically modified according to the execution environment requirement, where each component is a probable point of failure. Existing appr...
198
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
137
click to vote
TALG
2010
15 years 5 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
236
click to vote
TDP
2010
15 years 5 months ago
2010
Abstract. Several national statistical agencies are now releasing partially synthetic, public use microdata. These comprise the units in the original database with sensitive or ide...