Sciweavers

258 search results - page 20 / 52
» Improving Stability of Decision Trees
Sort
View
CADE
2001
Springer
14 years 2 months ago
Approximating Dependency Graphs Using Tree Automata Techniques
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
Aart Middeldorp
TCSV
2008
139views more  TCSV 2008»
13 years 9 months ago
A Fast MB Mode Decision Algorithm for MPEG-2 to H.264 P-Frame Transcoding
Abstract--The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter-and intra-prediction modes at the expense of higher computat...
Gerardo Fernández-Escribano, Hari Kalva, Pe...
IJHCI
2010
144views more  IJHCI 2010»
13 years 8 months ago
Naturalistic Decision Making for Power System Operators
Motivation – Investigations of large-scale outages in the North American interconnected electric system often attribute the causes to three T’s: Trees, Training and Tools. To ...
Frank L. Greitzer, Robin Podmore, Marck Robinson, ...
EOR
2002
84views more  EOR 2002»
13 years 9 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
FOCS
2006
IEEE
14 years 3 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys