2434 search results - page 51 / 487 » Algorithmic Randomness of Closed Sets |
105
click to vote
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
109
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
123
click to vote
IJCNN
2007
IEEE
15 years 9 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
126
Voted
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
112
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...