Sciweavers

126 search results - page 15 / 26
» Definitional Trees
Sort
View
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
16 years 2 months ago
Reimer's inequality and tardos' conjecture
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
Clifford D. Smyth
105
Voted
GFKL
2007
Springer
137views Data Mining» more  GFKL 2007»
15 years 5 months ago
Families of Dendrograms
A conceptual framework for cluster analysis from the viewpoint of p-adic geometry is introduced by describing the space of all dendrograms for n datapoints and relating it to the m...
Patrick Erik Bradley
AUSAI
2006
Springer
15 years 5 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
CICLING
2008
Springer
15 years 3 months ago
Sense Annotation in the Penn Discourse Treebank
Abstract. An important aspect of discourse understanding and generation involves the recognition and processing of discourse relations. These are conveyed by discourse connectives,...
Eleni Miltsakaki, Livio Robaldo, Alan Lee, Aravind...
ADMA
2006
Springer
153views Data Mining» more  ADMA 2006»
15 years 3 months ago
An Effective Combination Based on Class-Wise Expertise of Diverse Classifiers for Predictive Toxicology Data Mining
This paper presents a study on the combination of different classifiers for toxicity prediction. Two combination operators for the Multiple-Classifier System definition are also pr...
Daniel Neagu, Gongde Guo, Shanshan Wang