Sciweavers

651 search results - page 33 / 131
» Decisions in thesaurus construction and use
Sort
View
126
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
15 years 12 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
ICIP
2003
IEEE
16 years 1 months ago
Inverse halftoning by decision tree learning
Inverse halftoning is the process to retrieve a (gray) continuous-tone image from a halftone. Recently, machinelearning-based inverse halftoning techniques have been proposed. Dec...
Hae Yong Kim, Ricardo L. de Queiroz
NIPS
2004
15 years 1 months ago
Heuristics for Ordering Cue Search in Decision Making
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
Peter M. Todd, Anja Dieckmann
CONCUR
2010
Springer
14 years 10 months ago
On the Use of Non-deterministic Automata for Presburger Arithmetic
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
Antoine Durand-Gasselin, Peter Habermehl
AAAI
2006
15 years 1 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch