148 search results - page 2 / 30 » Constructing Big Trees from Short Sequences |
102
click to vote
CTRSA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
ECAI
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. This paper proposes a novel approach to discover options in the form of conditionally terminating sequences, and shows how they can be integrated into reinforcement learn...
99
Voted
CANDC
2005
ACM
14 years 10 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
CCECE
2006
IEEE
15 years 5 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
ACL
2001
15 years 7 days ago
2001
Considering the difficulties inherent in the manual construction of natural language parsers, we have designed and implemented our system GRIND which is capable of learning a sequ...