Results 261 to 270 of about 87,683 (308)
Some of the next articles are maybe not open access.
Proceedings of the eighth ACM symposium on Solid modeling and applications, 2003
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algorithms have been developed that have theoretical guarantee of computing a topologically correct and geometrically close surface under certain condition on sampling density ...
Tamal K. Dey, Samrat Goswami
openaire +1 more source
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algorithms have been developed that have theoretical guarantee of computing a topologically correct and geometrically close surface under certain condition on sampling density ...
Tamal K. Dey, Samrat Goswami
openaire +1 more source
Current Biology, 1998
ABSTRACT Tight junctions are the most apical intercellular junctions of epithelial and endothelial cells and create a regulatable semipermeable diffusion barrier between individual cells. On a cellular level, they form an intramembrane diffusion fence that restricts the intermixing of apical and basolateral membrane components.
Maria S, Balda, Karl, Matter
openaire +3 more sources
ABSTRACT Tight junctions are the most apical intercellular junctions of epithelial and endothelial cells and create a regulatable semipermeable diffusion barrier between individual cells. On a cellular level, they form an intramembrane diffusion fence that restricts the intermixing of apical and basolateral membrane components.
Maria S, Balda, Karl, Matter
openaire +3 more sources
Proceedings of IEEE 36th Annual Foundations of Computer Science, 2000
Summary: This paper lays a theoretical foundation for scaling fault tolerant tasks to large and diversified networks such as the Internet. In such networks, there are always parts of the network that fail. On the other hand, various subtasks interest only parts of the network, and it is desirable that those parts, if nonfaulty, do not suffer from ...
Shay Kutten, David Peleg
openaire +3 more sources
Summary: This paper lays a theoretical foundation for scaling fault tolerant tasks to large and diversified networks such as the Internet. In such networks, there are always parts of the network that fail. On the other hand, various subtasks interest only parts of the network, and it is desirable that those parts, if nonfaulty, do not suffer from ...
Shay Kutten, David Peleg
openaire +3 more sources
1993
Summary: We define the \(\theta\)-tightness and \(\theta\)-bitightness of a topological space and give some results in connection with these notions. In particular we prove that for every subset \(A\) of an Urysohn space \(X\) it holds \(| [A]_ \theta | \leq | A|^{\text{bt}_ \theta (X)}\), where \([A]_ \theta\) denotes the smallest \(\theta\)-closed ...
CAMMAROTO, Filippo, L. J. KOCINAC
openaire +2 more sources
Summary: We define the \(\theta\)-tightness and \(\theta\)-bitightness of a topological space and give some results in connection with these notions. In particular we prove that for every subset \(A\) of an Urysohn space \(X\) it holds \(| [A]_ \theta | \leq | A|^{\text{bt}_ \theta (X)}\), where \([A]_ \theta\) denotes the smallest \(\theta\)-closed ...
CAMMAROTO, Filippo, L. J. KOCINAC
openaire +2 more sources
2004
The tightness of a constraint refers to how restricted the constraint is. The existing work shows that there exists a relationship between tightness and global consistency of a constraint network. In this paper, we conduct a comprehensive study on this relationship.
openaire +2 more sources
The tightness of a constraint refers to how restricted the constraint is. The existing work shows that there exists a relationship between tightness and global consistency of a constraint network. In this paper, we conduct a comprehensive study on this relationship.
openaire +2 more sources