285 search results - page 29 / 57 » New Ways to Construct Binary Search Trees |
170
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Machine learning techniques have shown to improve bacterial species classification based on fatty acid methyl ester (FAME) data. Nonetheless, FAME analysis has a limit...
153
click to vote
ESORICS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
161
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
215
click to vote
PLANX
2008
15 years 7 months ago
2008
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
197
click to vote
CPM
2005
Springer
15 years 11 months ago
2005
Springer
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....