Results 251 to 260 of about 301,044 (304)
Some of the next articles are maybe not open access.

A Note on Thinning

IEEE Transactions on Systems, Man, and Cybernetics, 1976
Implementation of a simple algorithm is described for thinning digital objects down to ``skeletons.'' A method of detecting ``noisy'' branches of a skeleton, with the aid of the distance transform of the original object, is developed.
Azriel Rosenfeld, Larry S. Davis
openaire   +3 more sources

To Thin or Not to Thin: A Case of Peripartum Cardiomyopathy

Canadian Journal of Cardiology, 2014
We describe the case of a 29-year-old woman with peripartum cardiomyopathy (PPCM) complicated by multiple cerebral infarcts. Current treatment of PPCM is reviewed with a focus on the role of anticoagulation in PPCM.
Sophie, Corriveau   +2 more
openaire   +2 more sources

CHARACTERIZATIONS OF THIN AND SEMI-THIN SETS

Analysis, 1988
This paper characterizes sets E in \({\mathbb{R}}^ m\) which are thin at the origin in terms of increasing functions \(\phi\) : (0,1]\(\to (0,+\infty)\) such that \(\phi\) (t)\(\to 0\) as \(t\to 0+\) and that the function \(t\mapsto t^{2-m} \phi (t)\) is decreasing on (0,1].
Armitage, David H., Goldstein, Myron
openaire   +2 more sources

INVARIANT THINNING

International Journal of Pattern Recognition and Artificial Intelligence, 1993
One of the most widely used methods for preprocessing binary images is thinning. The popularity of this method rests on the fact that considerable data reduction is achieved while retaining “essential” properties of the original image. Moreover, topological features, which cannot be verified by a genuinely parallel method (by Minsky and Papert22) are ...
Ulrich Eckhardt, Gerd Maderlechner
openaire   +1 more source

The thinned plantation

Biometrika, 1974
A point process is obtained by considering a square lattice of side p½, 0 < p ≦ 1, and supposing that each lattice point contains a point of the process or does not independently, with probabilities p and 1 – p. The family of processes thus includes the deterministic lattice for p = 1, and has the Poisson as a limit as p → 0.
Brown, Susannah, Holgate, P.
openaire   +1 more source

THIN SUBBASES

Analysis, 1986
A set \(M\subset\mathbb N_0\) is called a basis of order \(k\) for \(A\subset\mathbb N_0\), if every \(a\in A\) can be written as a sum of \(k\) elements of \(M\) and \(k\) is minimal. In this clearly written article the author uses the probabilistic method of \textit{P. Erdős} and \textit{A. Rényi} [Acta Arith.
openaire   +1 more source

Thinning akamai

Proceedings of the 8th ACM SIGCOMM conference on Internet measurement, 2008
Global-scale Content Distribution Networks (CDNs), such as Akamai, distribute thousands of servers worldwide providing a highly reliable service to their customers. Not only has reliability been one of the main design goals for such systems - they are engineered to operate under severe and constantly changing number of server failures occurring at all ...
Ao-Jan Su, Aleksandar Kuzmanovic
openaire   +2 more sources

Home - About - Disclaimer - Privacy