Sciweavers

1414 search results - page 126 / 283
» Combining Intruder Theories
Sort
View
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
16 years 1 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
KDD
2006
ACM
123views Data Mining» more  KDD 2006»
16 years 1 months ago
Mining rank-correlated sets of numerical attributes
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
Toon Calders, Bart Goethals, Szymon Jaroszewicz
81
Voted
ICFP
2006
ACM
16 years 22 days ago
Boxy types: inference for higher-rank types and impredicativity
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annot...
Dimitrios Vytiniotis, Stephanie Weirich, Simon L. ...
98
Voted
CVPR
2010
IEEE
15 years 8 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
96
Voted
LATA
2010
Springer
15 years 7 months ago
Using Sums-of-Products for Non-standard Reasoning
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
Rafael Peñaloza