6833 search results - page 79 / 1367 » Some two-character sets |
101
click to vote
RSFDGRC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, int...
DAGM
2004
Springer
15 years 5 months ago
2004
Springer
We address the difficulty of image segmentation methods based on the popular level set framework to handle an arbitrary number of regions. While in the literature some level set t...
106
click to vote
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
LREC
2008
15 years 1 months ago
2008
Spectral clustering is a powerful clustering method for document data set. However, spectral clustering needs to solve an eigenvalue problem of the matrix converted from the simil...
80
Voted
IJCAI
2007
15 years 1 months ago
2007
We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in mu...