Sciweavers

2713 search results - page 171 / 543
» Parameterized Tree Systems
Sort
View
124
Voted
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 7 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
IJON
2006
146views more  IJON 2006»
15 years 3 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang
CVIU
2011
14 years 10 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
235
Voted
POPL
2006
ACM
16 years 4 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
HICSS
2008
IEEE
119views Biometrics» more  HICSS 2008»
15 years 10 months ago
Tree Mining in Mental Health Domain
The number of mentally ill people is increasing globally each year. Despite major medical advances, the identification of genetic and environmental factors responsible for mental ...
Maja Hadzic, Fedja Hadzic, Tharam S. Dillon