Sciweavers

19798 search results - page 402 / 3960
» Is Structural Subtyping Useful
Sort
View
155
Voted
COMPSAC
2006
IEEE
15 years 9 months ago
Data Structure and Algorithm in Data Mining: Granular Computing View
This paper discusses foundations of conventional style of rule mining in which rules are extracted from a data table. Rule mining mainly uses the structure of a table, data partit...
Shusaku Tsumoto
124
Voted
AINA
2005
IEEE
15 years 9 months ago
Efficient Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chu-Hsing Lin, Wei Lee
127
Voted
ICDM
2005
IEEE
188views Data Mining» more  ICDM 2005»
15 years 9 months ago
CLUMP: A Scalable and Robust Framework for Structure Discovery
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
Kunal Punera, Joydeep Ghosh
114
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
Towards in-place geometric algorithms and data structures
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
Hervé Brönnimann, Timothy M. Chan, Eri...
151
Voted
PPSN
2004
Springer
15 years 9 months ago
A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Jorge Muruzábal, Carlos Cotta