Sciweavers

801 search results - page 17 / 161
» Minimal Locked Trees
Sort
View
WABI
2010
Springer
168views Bioinformatics» more  WABI 2010»
14 years 7 months ago
The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
Jesper Jansson, Richard S. Lemence, Andrzej Lingas
RTSS
2003
IEEE
15 years 2 months ago
Data Caches in Multitasking Hard Real-Time Systems
Data caches are essential in modern processors, bridging the widening gap between main memory and processor speeds. However, they yield very complex performance models, which make...
Xavier Vera, Björn Lisper, Jingling Xue
ACL
2001
14 years 11 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
ICPR
2008
IEEE
15 years 4 months ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
DIM
2008
ACM
14 years 11 months ago
Minimal information disclosure with efficiently verifiable credentials
Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). However, plain certificates provide a binary ide...
David Bauer, Douglas M. Blough, David Cash