Sciweavers

4095 search results - page 29 / 819
» How to test a tree
Sort
View
ITC
2003
IEEE
170views Hardware» more  ITC 2003»
14 years 1 months ago
Double-Tree Scan: A Novel Low-Power Scan-Path Architecture
In a scan-based system with a large number of flip-flops, a major component of power is consumed during scanshift and clocking operation in test mode. In this paper, a novel scan-...
Bhargab B. Bhattacharya, Sharad C. Seth, Sheng Zha...
IANDC
2011
148views more  IANDC 2011»
13 years 2 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
ICML
2004
IEEE
14 years 8 months ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...
DLT
2008
13 years 9 months ago
Tree Automata with Global Constraints
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
ML
2006
ACM
132views Machine Learning» more  ML 2006»
13 years 7 months ago
A suffix tree approach to anti-spam email filtering
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
Rajesh Pampapathi, Boris Mirkin, Mark Levene