Sciweavers

253 search results - page 22 / 51
» Dynamic Trees and Dynamic Point Location
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
TCOM
2010
112views more  TCOM 2010»
13 years 6 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang
AOSD
2003
ACM
14 years 26 days ago
A case for statically executable advice: checking the law of demeter with AspectJ
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
Karl J. Lieberherr, David H. Lorenz, Pengcheng Wu
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
13 years 11 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif
PG
2000
IEEE
13 years 12 months ago
Dynamic PDE Surfaces with Flexible and General Geometric Constraints
PDE surfaces, whose behavior is governed by Partial Differential Equations (PDEs), have demonstrated many modeling advantages in surface blending, free-form surface modeling, and ...
Haixia Du, Hong Qin