Sciweavers

462 search results - page 65 / 93
» Covering a Tree by a Forest
Sort
View
NAR
2011
198views Computer Vision» more  NAR 2011»
12 years 10 months ago
PhylomeDB v3.0: an expanding repository of genome-wide collections of trees, alignments and phylogeny-based orthology and paralo
The growing availability of complete genomic sequences from diverse species has brought about the need to scale up phylogenomic analyses, including the reconstruction of large col...
Jaime Huerta-Cepas, Salvador Capella-Gutiér...
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
GC
2008
Springer
13 years 7 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
MT
2010
134views more  MT 2010»
13 years 5 months ago
Improve syntax-based translation using deep syntactic structures
This paper introduces deep syntactic structures to syntax-based Statistical Machine Translation (SMT). We use a Head-driven Phrase Structure Grammar (HPSG) parser to obtain the de...
Xianchao Wu, Takuya Matsuzaki, Jun-ichi Tsujii
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 23 days ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky