1376 search results - page 86 / 276 » Searching Trees: An Essay |
GCB
1997
Springer
15 years 4 months ago
1997
Springer
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
103
click to vote
IPL
2000
14 years 11 months ago
2000
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
MT
2006
14 years 12 months ago
2006
Abstract. This paper describes an example-based machine translation (EBMT) method based on tree-string correspondence (TSC) and statistical generation. In this method, the translat...
108
click to vote
TALG
2008
14 years 11 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...