Sciweavers

520 search results - page 28 / 104
» Subset Counting in Trees
Sort
View
KBSE
2007
IEEE
14 years 2 months ago
Test suite reduction and prioritization with call trees
This paper presents a tool that (i) constructs tree-based models of a program’s behavior during testing and (ii) employs these trees while reordering and reducing a test suite. ...
Adam M. Smith, Joshua Geiger, Gregory M. Kapfhamme...
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
14 years 17 min ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 3 days ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
WWW
2009
ACM
14 years 8 months ago
Crosslanguage blog mining and trend visualisation
People use weblogs to express thoughts, present ideas and share knowledge, therefore weblogs are extraordinarily valuable resources, amongs others, for trend analysis. Trends are ...
Andreas Juffinger, Elisabeth Lex
TELSYS
2002
128views more  TELSYS 2002»
13 years 7 months ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo