Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,269
The TCP Maximum Segment Size and Related Topics
- RFC 879, SRI Network Information Center
, 1983
"... This memo discusses the TCP Maximum Segment Size Option and related topics. The purposes is to clarify some aspects of TCP and its interaction with IP. This memo is a clarification to the TCP specification, and contains information that may be considered as "advice to implementers". 1. ..."
Abstract
-
Cited by 41 (1 self)
- Add to MetaCart
This memo discusses the TCP Maximum Segment Size Option and related topics. The purposes is to clarify some aspects of TCP and its interaction with IP. This memo is a clarification to the TCP specification, and contains information that may be considered as "advice to implementers". 1.
Deformable models in medical image analysis: A survey
- Medical Image Analysis
, 1996
"... This article surveys deformable models, a promising and vigorously researched computer-assisted medical image analysis technique. Among model-based techniques, deformable models offer a unique and powerful approach to image analysis that combines geometry, physics, and approximation theory. They hav ..."
Abstract
-
Cited by 591 (7 self)
- Add to MetaCart
. They have proven to be effective in segmenting, matching, and tracking anatomic structures by exploiting (bottom-up) constraints derived from the image data together with (top-down) a priori knowledge about the location, size, and shape of these structures. Deformable models are capable of accommodating
An Implementation of Guarded Pointers with Tight Bounds on Segment Size
- on Segment Size”, Project Aries Technical Memo ARIES-TM-02, AI Lab, M.I.T
, 1999
"... ters [Carter94]. A guarded pointer is an unforgeable capability [Fabry74] with all relevant permission and segment size bits contained in the pointer itself (we will use the term segment to denote an allocated block of memory and object to denote data within a segment). Since user programs are not p ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
ters [Carter94]. A guarded pointer is an unforgeable capability [Fabry74] with all relevant permission and segment size bits contained in the pointer itself (we will use the term segment to denote an allocated block of memory and object to denote data within a segment). Since user programs
Adapting TCP Segment Size in Cellular Networks
"... Abstract. In cellular networks, a frame size is generally made small to reduce the impact of errors. Thus, a segment of transport layer is splitted into multiple frames before transmission. A problem is that the whole segment is lost when a frame of a segment is lost. So, the segment error rate tend ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. In cellular networks, a frame size is generally made small to reduce the impact of errors. Thus, a segment of transport layer is splitted into multiple frames before transmission. A problem is that the whole segment is lost when a frame of a segment is lost. So, the segment error rate
Rotavirus RNA Segments Sized by Electron Microscopy
, 1983
"... The RNA segments of bovine rotavirus (UK Compton strain) were measured by electron microscopy in mixtures containing q~X174 double-stranded DNA as an internal reference molecule. The numbers of base pairs per segment were calculated and compared with data obtained by other procedures (comparative RN ..."
Abstract
- Add to MetaCart
The RNA segments of bovine rotavirus (UK Compton strain) were measured by electron microscopy in mixtures containing q~X174 double-stranded DNA as an internal reference molecule. The numbers of base pairs per segment were calculated and compared with data obtained by other procedures (comparative
Segment Sizes and Lifetimes in Algol 60 Programs
"... The characteristics of the virtual memory require-ments of a sample of Algol 60 programs have been measured. Distributions are presented for the sizes of memory requests and for their holding times (lifetimes). The results are presented in terms of Johnston's contour model and a simple abstract ..."
Abstract
- Add to MetaCart
The characteristics of the virtual memory require-ments of a sample of Algol 60 programs have been measured. Distributions are presented for the sizes of memory requests and for their holding times (lifetimes). The results are presented in terms of Johnston's contour model and a simple
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
- IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Cl ..."
Abstract
-
Cited by 360 (0 self)
- Add to MetaCart
A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices
Optimal Segment Size for Fixed-sized Segment Protection in Wavelength-routed Optical Networks
"... Abstract—Protecting a network against link failures is a major challenge faced by network operators. The protection scheme has to address two important objectives- fast recovery and minimizing the amount of backup resources needed. Every protection algorithm is a tradeoff between these two objective ..."
Abstract
- Add to MetaCart
objectives. In this paper, we study the problem of segment protection. In particular, we investigate what is the optimal segment size that obtains the best tradeoff between the time taken for recovery and minimizing the bandwidth used by the backup segments. We focus on the uniform fixed-length segment
Unsupervised Learning of the Morphology of a Natural Language
- COMPUTATIONAL LINGUISTICS
, 2001
"... This study reports the results of using minimum description length (MDL) analysis to model unsupervised learning of the morphological segmentation of European languages, using corpora ranging in size from 5,000 words to 500,000 words. We develop a set of heuristics that rapidly develop a probabilist ..."
Abstract
-
Cited by 355 (12 self)
- Add to MetaCart
This study reports the results of using minimum description length (MDL) analysis to model unsupervised learning of the morphological segmentation of European languages, using corpora ranging in size from 5,000 words to 500,000 words. We develop a set of heuristics that rapidly develop a
Results 1 - 10
of
6,269
