Results 1  10
of
1,272,933
Convolutional codes with maximum distance profile
 Syst. Contr. Lett
, 2005
"... Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other convolutional code of the same rate and degree. In this paper we use met ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other convolutional code of the same rate and degree. In this paper we use
Maximum Distance Separable Convolutional Codes
 APPL. ALGEBRA ENGRG. COMM. COMPUT
, 1998
"... A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all linear block codes of rate k/n. It is well known that MDS block codes do exist if the field size is more than n. In this paper we generalize this concept to the class of convolutional codes of a fixed ..."
Abstract

Cited by 40 (10 self)
 Add to MetaCart
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all linear block codes of rate k/n. It is well known that MDS block codes do exist if the field size is more than n. In this paper we generalize this concept to the class of convolutional codes of a fixed
On the graphs with maximum distance on kdiameter
"... The distance of a set of vertices is the sum of the distances between pairs of vertices in the set. We define the kdiameter of a graph as the maximum distance of a set of k vertices; so the 2diameter is the normal diameter and the ndiameter where n is the order is the distance of the graph. We co ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The distance of a set of vertices is the sum of the distances between pairs of vertices in the set. We define the kdiameter of a graph as the maximum distance of a set of k vertices; so the 2diameter is the normal diameter and the ndiameter where n is the order is the distance of the graph. We
Maximum Distance Separable SymbolPair Codes
"... Abstract—We study (symbolpair) codes for symbolpair read channels introduced recently by Cassuto and Blaum (2010). A Singletontype bound on symbolpair codes is established and infinite families of optimal symbolpair codes are constructed. These codes are maximum distance separable (MDS) in the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—We study (symbolpair) codes for symbolpair read channels introduced recently by Cassuto and Blaum (2010). A Singletontype bound on symbolpair codes is established and infinite families of optimal symbolpair codes are constructed. These codes are maximum distance separable (MDS
Maximum entropy markov models for information extraction and segmentation
, 2000
"... Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many textrelated tasks, such as partofspeech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled as multinomial ..."
Abstract

Cited by 554 (18 self)
 Add to MetaCart
, capitalization, formatting, partofspeech), and defines the conditional probability of state sequences given observation sequences. It does this by using the maximum entropy framework to fit a set of exponential models that represent the probability of a state given an observation and the previous state. We
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2109 (30 self)
 Add to MetaCart
of distancebased and parsimony approaches. The reduction of computing time is dramatic in comparison with other maximumlikelihood packages, while the likelihood maximization ability tends to be higher. For example, only 12 min were required on a standard personal computer to analyze a data set consisting
Maximum distancegradient for robust image registration
, 2008
"... To make up for the lack of concern on the spatial information in the conventional mutual information based image registration framework, this paper designs a novel spatial feature field, namely the maximum distancegradient (MDG) vector field, for registration tasks. It encodes both the local edge i ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
To make up for the lack of concern on the spatial information in the conventional mutual information based image registration framework, this paper designs a novel spatial feature field, namely the maximum distancegradient (MDG) vector field, for registration tasks. It encodes both the local edge
Predicting Internet Network Distance with CoordinatesBased Approaches
 In INFOCOM
, 2001
"... In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract

Cited by 633 (5 self)
 Add to MetaCart
In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which
Adhoc OnDemand Distance Vector Routing
 IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS
, 1997
"... An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such adhoc n ..."
Abstract

Cited by 3167 (15 self)
 Add to MetaCart
An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad
Results 1  10
of
1,272,933