2434 search results - page 230 / 487 » Algorithmic Randomness of Closed Sets |
175
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
138
click to vote
MVA
2007
15 years 3 months ago
2007
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
148
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
156
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
169
click to vote
CVPR
1998
IEEE
16 years 6 months ago
1998
IEEE
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...