Sciweavers

1017 search results - page 111 / 204
» Some existence and construction results of polygonal designs
Sort
View
MCS
2007
Springer
16 years 17 days ago
Classifier Combining Rules Under Independence Assumptions
Classifier combining rules are designed for the fusion of the results from the component classifiers in a multiple classifier system. In this paper, we firstly propose a theoretica...
Shoushan Li, Chengqing Zong
MLDM
2005
Springer
15 years 12 months ago
SSC: Statistical Subspace Clustering
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
Laurent Candillier, Isabelle Tellier, Fabien Torre...
VLDB
2004
ACM
127views Database» more  VLDB 2004»
15 years 11 months ago
Computing Frequent Itemsets Inside Oracle 10G
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
Wei Li, Ari Mozes
IJSYSC
2000
74views more  IJSYSC 2000»
15 years 6 months ago
Towards the evolutionary emergence of increasingly complex advantageous behaviours
The generation of complex entities with advantageous behaviours beyond our manual design capability requires long-term incremental evolution with continuing emergence. In this pap...
A. D. Channon, Robert I. Damper
SMA
2008
ACM
154views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Consistent computation of first- and second-order differential quantities for surface meshes
Differential quantities, including normals, curvatures, principal directions, and associated matrices, play a fundamental role in geometric processing and physics-based modeling. ...
Xiangmin Jiao, Hongyuan Zha