Sciweavers

1376 search results - page 136 / 276
» Searching Trees: An Essay
Sort
View
KDD
2001
ACM
164views Data Mining» more  KDD 2001»
16 years 6 months ago
Data mining criteria for tree-based regression and classification
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
Andreas Buja, Yung-Seop Lee
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
16 years 27 days ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 2 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
CADE
2009
Springer
16 years 7 months ago
Ground Interpolation for Combined Theories
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
Amit Goel, Sava Krstic, Cesare Tinelli
ACCV
2009
Springer
16 years 1 months ago
Interactive Super-Resolution through Neighbor Embedding
Learning based super-resolution can recover high resolution image with high quality. However, building an interactive learning based super-resolution system for general images is e...
Jian Pu, Junping Zhang, Peihong Guo, Xiaoru Yuan