Sciweavers

2382 search results - page 247 / 477
» Generating Seeded Trees from Data Sets
Sort
View
DAM
2010
112views more  DAM 2010»
14 years 11 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
VLDB
1997
ACM
94views Database» more  VLDB 1997»
15 years 3 months ago
To Weave the Web
The paper discusses the issue of views in the Web context. We introduce a set of languages for managing and restructuring data coming from the World Wide Web. We present a specifi...
Paolo Atzeni, Giansalvatore Mecca, Paolo Merialdo
ICDE
2010
IEEE
220views Database» more  ICDE 2010»
14 years 9 months ago
Profiling linked open data with ProLOD
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
Christoph Böhm, Felix Naumann, Ziawasch Abedj...
ICML
2004
IEEE
16 years 13 days ago
Large margin hierarchical classification
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
Ofer Dekel, Joseph Keshet, Yoram Singer
PODS
2005
ACM
115views Database» more  PODS 2005»
15 years 11 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...