Sciweavers

20 search results - page 3 / 4
» The number of equivalence classes of symmetric sign patterns
Sort
View
JCT
2010
112views more  JCT 2010»
13 years 4 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
13 years 7 months ago
Boosting Optimal Logical Patterns Using Noisy Data
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
Noam Goldberg, Chung-chieh Shan
SGAI
2004
Springer
13 years 11 months ago
Exploiting Causal Independence in Large Bayesian Networks
The assessment of a probability distribution associated with a Bayesian network is a challenging task, even if its topology is sparse. Special probability distributions based on t...
Rasa Jurgelenaite, Peter J. F. Lucas
CSCLP
2006
Springer
13 years 9 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 6 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li