2434 search results - page 12 / 487 » Algorithmic Randomness of Closed Sets |
IPMI
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
JCB
2006
14 years 9 months ago
2006
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
SMA
2005
ACM
15 years 3 months ago
2005
ACM
We present an algorithm for generating the Voronoi cells for a set of rational C1 -continuous planar closed curves, which is precise up to machine precision. Initially, bisectors ...
PAKDD
2010
ACM
14 years 11 months ago
2010
ACM
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...