Sciweavers

39 search results - page 6 / 8
» Compiling pattern matching to good decision trees
Sort
View
IUI
2009
ACM
14 years 2 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...
IANDC
2011
129views more  IANDC 2011»
13 years 18 days ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 5 months ago
Extraction of Symbolic Rules from Artificial Neural Networks
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
S. M. Kamruzzaman, Md. Monirul Islam
SPIRE
2009
Springer
14 years 5 days ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...
BIOID
2008
103views Biometrics» more  BIOID 2008»
13 years 7 months ago
Promoting Diversity in Gaussian Mixture Ensembles: An Application to Signature Verification
Abstract. Classifiers based on Gaussian mixture models are good performers in many pattern recognition tasks. Unlike decision trees, they can be described as stable classifier: a s...
Jonas Richiardi, Andrzej Drygajlo, Laetitia Todesc...