Sciweavers

2382 search results - page 136 / 477
» Generating Seeded Trees from Data Sets
Sort
View
P2P
2008
IEEE
120views Communications» more  P2P 2008»
15 years 11 months ago
Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks
Trees are fundamental structures for data dissemination in large-scale network scenarios. However, their inherent fragility has led researchers to rely on more redundant mesh topo...
Davide Frey, Amy L. Murphy
APVIS
2009
15 years 5 months ago
Point-based tree representation: A new approach for large hierarchies
Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose a new app...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...
IGARSS
2009
15 years 2 months ago
Within- and Between-class Variability of Spectrally Similar Tree Species
In this paper, a comparison is made through evaluating the withinand between-class species variability for the original, the first derivative and second derivative spectra. For ea...
Pravesh Debba, Moses Azong Cho, Renaud Mathieu
NAACL
2010
15 years 2 months ago
The Effect of Ambiguity on the Automated Acquisition of WSD Examples
Several methods for automatically generating labeled examples that can be used as training data for WSD systems have been proposed, including a semisupervised approach based on re...
Mark Stevenson, Yikun Guo
JCT
2011
86views more  JCT 2011»
14 years 11 months ago
Descendant-homogeneous digraphs
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...
Daniela Amato, John K. Truss