Sciweavers

16430 search results - page 86 / 3286
» On Computable Tree Functions
Sort
View
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
15 years 7 months ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
15 years 9 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
BIRTHDAY
2008
Springer
15 years 5 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Networks
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
Robert Mateescu, Rina Dechter
122
Voted
DIGRA
2005
Springer
15 years 8 months ago
Dialog as a Game
We describe a technique to manage pre-written lines of dialog by treating a conversation as a game. Thinking of conversation as a game means structuring it as a series of moves, m...
Peter Border
CORR
1998
Springer
142views Education» more  CORR 1998»
15 years 3 months ago
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the...
Norbert Bröker