Results 1  10
of
1,176,524
Reparametrizations of Continuous Paths
"... In elementary differential geometry, the most basic objects studied (after points perhaps) are paths, i.e., differentiable maps p: I → n defined on the closed interval I = [0, 1]. Such a path is called regular if p ′ (t) = 0 for all t ∈]0, 1[. A reparametrization of the ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In elementary differential geometry, the most basic objects studied (after points perhaps) are paths, i.e., differentiable maps p: I → n defined on the closed interval I = [0, 1]. Such a path is called regular if p ′ (t) = 0 for all t ∈]0, 1[. A reparametrization of the
Continuous path planning with multiple constraints
 in Proceedings of the 42nd IEEE Conference on Decision and Control, Maui
, 2003
"... A condensed version of this paper appears in the CDC 2003 proceedings. We examine the problem of planning a path through a low dimensional continuous state space subject to upper bounds on several additive cost metrics. For the single cost case, previously published research has proposed constructin ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
A condensed version of this paper appears in the CDC 2003 proceedings. We examine the problem of planning a path through a low dimensional continuous state space subject to upper bounds on several additive cost metrics. For the single cost case, previously published research has proposed
Comparison of parametric representations for monosyllabic word recognition in continuously spoken sentences
 ACOUSTICS, SPEECH AND SIGNAL PROCESSING, IEEE TRANSACTIONS ON
, 1980
"... Several parametric representations of the acoustic signal were compared as to word recognition performance in a syllableoriented continuous speech recognition system. The vocabulary included many phonetically similar monosyllabic words, therefore the emphasis was on ability to retain phonetically ..."
Abstract

Cited by 1089 (2 self)
 Add to MetaCart
Several parametric representations of the acoustic signal were compared as to word recognition performance in a syllableoriented continuous speech recognition system. The vocabulary included many phonetically similar monosyllabic words, therefore the emphasis was on ability to retain
Connecting Discrete and Continuous PathDependent Options
, 1999
"... . This paper develops methods for relating the prices of discrete and continuoustime versions of pathdependent options sensitive to extremal values of the underlying asset, including lookback, barrier, and hindsight options. The relationships take the form of correction terms that can be interpre ..."
Abstract

Cited by 54 (5 self)
 Add to MetaCart
. This paper develops methods for relating the prices of discrete and continuoustime versions of pathdependent options sensitive to extremal values of the underlying asset, including lookback, barrier, and hindsight options. The relationships take the form of correction terms that can
Continuous Path Planning with Multiple Constraints*
"... %'e examine the problem of planning a path through a low dimensional continuous state space subject to upper hounds on several additive cost metrics. For the single cost case, previously published research has prposed constructing the paths by gradient descent on a local minima free value fun ..."
Abstract
 Add to MetaCart
%'e examine the problem of planning a path through a low dimensional continuous state space subject to upper hounds on several additive cost metrics. For the single cost case, previously published research has prposed constructing the paths by gradient descent on a local minima free value
A maximum likelihood approach to continuous speech recognition
 IEEE Trans. Pattern Anal. Machine Intell
, 1983
"... AbstractSpeech recognition is formulated as a problem of maximum likelihood decoding. This formulation requires statistical models of the speech production process. In this paper, we describe a number of statistical models for use in speech recognition. We give special attention to determining the ..."
Abstract

Cited by 472 (9 self)
 Add to MetaCart
AbstractSpeech recognition is formulated as a problem of maximum likelihood decoding. This formulation requires statistical models of the speech production process. In this paper, we describe a number of statistical models for use in speech recognition. We give special attention to determining the parameters for such models from sparse data. We also describe two decoding methods, one appropriate for constrained artificial languages and one appropriate for more realistic decoding tasks. To illustrate the usefulness of the methods described, we review a number of decoding results that have been obtained with them. Index TermsMarkov models, maximum likelihood, parameter estimation, speech recognition, statistical models. I.
Mining Repetitive Clips through Finding Continuous Paths
, 2007
"... Automatically discovering repetitive clips from large video database is a challenging problem due to the enormous computational cost involved in exploring the huge solution space. Without any a priori knowledge of the contents, lengths and total number of the repetitive clips, we need to discover al ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
all of them in the video database. To address the large computational cost, we propose a novel method which translates repetitive clip mining to the continuous path finding problem in a matching trellis, where sequence matching can be accelerated by taking advantage of the temporal redundancies
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 678 (27 self)
 Add to MetaCart
its traffic on the minimumlatency path available to it, given the network congestion caused by the other users. In general such a “selfishly motivated ” assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
A DelayTolerant Network Architecture for Challenged Internets
, 2003
"... The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme env ..."
Abstract

Cited by 937 (13 self)
 Add to MetaCart
The highly successful architecture and protocols of today’s Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme
Results 1  10
of
1,176,524