2434 search results - page 18 / 487 » Algorithmic Randomness of Closed Sets |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
This paper conducts an in-depth study on a classical perceptual-organization problem: finding salient closed boundaries from a set of boundary fragments detected in a noisy image....
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
PKDD
2005
Springer
15 years 2 months ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
CIARP
2008
Springer
14 years 11 months ago
2008
Springer
The concept of elongation is generally well understood. However, there is no clear, precise, mathematical definition of elongation in any dictionary we could find. We propose that ...