IGARSS
2009
13 years 9 months ago
2009
High resolution airborne hyperspectral and discrete return LiDAR data were used to assess bare soil and tree cover differences along a land use transect consisting of state-owned,...
DLT
2009
13 years 9 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
ALGOSENSORS
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
LICS
2010
IEEE
13 years 9 months ago
2010
IEEE
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
ISITA
2010
13 years 9 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
ICPADS
2010
IEEE
13 years 9 months ago
2010
IEEE
Online Social Networks (OSNs) are more and more popular recently; people may through them interact with each other for the purpose of social intercourse. The client/server OSN arch...
ACL
2010
13 years 9 months ago
2010
We propose Bilingual Tree Kernels (BTKs) to capture the structural similarities across a pair of syntactic translational equivalences and apply BTKs to sub-tree alignment along wi...
TPDS
2010
13 years 10 months ago
2010
—In this paper we propose and evaluate an overlay distribution algorithm for P2P, chunk-based, streaming systems over forest-based topologies. In such systems, the stream is divi...
MST
2010
13 years 10 months ago
2010
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
JCO
2010
13 years 10 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...