Sciweavers

4095 search results - page 127 / 819
» How to test a tree
Sort
View
RECOMB
2009
Springer
14 years 11 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...
EVOW
2007
Springer
14 years 4 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
INFORMATICALT
2008
196views more  INFORMATICALT 2008»
13 years 10 months ago
An Efficient and Sensitive Decision Tree Approach to Mining Concept-Drifting Data Streams
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang
AAMAS
2012
Springer
12 years 6 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
14 years 3 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...