Results 1  10
of
64,785
OnLine Construction of Suffix Trees
, 1995
"... An online algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract

Cited by 438 (2 self)
 Add to MetaCart
of the string ready. The method is developed as a lineartime version of a very simple algorithm for (quadratic size) suffix tries. Regardless of its quadratic worstcase this latter algorithm can be a good practical method when the string is not too long. Another variation of this method is shown to give in a
Worstcase source for distributed compression with quadratic distortion
 In Proc. of Information Theory Workshop (ITW
, 2012
"... Abstract—We consider the kencoder source coding problem with a quadratic distortion measure. We show that among all source distributions with a given covariance matrixK, the jointly Gaussian source requires the highest rates in order to meet a given set of distortion constraints. I. ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract—We consider the kencoder source coding problem with a quadratic distortion measure. We show that among all source distributions with a given covariance matrixK, the jointly Gaussian source requires the highest rates in order to meet a given set of distortion constraints. I.
On Stochastic and Worstcase Models for Investing
"... In practice, most investing is done assuming a probabilistic model of stock price returns known as the Geometric Brownian Motion (GBM). While it is often an acceptable approximation, the GBM model is not always valid empirically. This motivates a worstcase approach to investing, called universal po ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
In practice, most investing is done assuming a probabilistic model of stock price returns known as the Geometric Brownian Motion (GBM). While it is often an acceptable approximation, the GBM model is not always valid empirically. This motivates a worstcase approach to investing, called universal
The worstcase risk of a portfolio
, 2000
"... We show how to compute in a numerically efficient way the maximum risk of a portfolio, given uncertainty in the means and covariances of asset returns. This is a semidefinite programming problem, and is readily solved by interiorpoint methods for convex optimization developed in recent years. While ..."
Abstract
 Add to MetaCart
We show how to compute in a numerically efficient way the maximum risk of a portfolio, given uncertainty in the means and covariances of asset returns. This is a semidefinite programming problem, and is readily solved by interiorpoint methods for convex optimization developed in recent years. While not as general, this approach is more accurate and much faster than Monte Carlo methods. The computational effort required grows gracefully, so that very large problems can be handled. The proposed approach is extended to portfolio selection, allowing for the design of portfolios which are robust with respect to model uncertainty.
Classifying chart cells for quadratic complexity contextfree inference
 In COLING
, 2008
"... In this paper, we consider classifying word positions by whether or not they can either start or end multiword constituents. This provides a mechanism for “closing ” chart cells during contextfree inference, which is demonstrated to improve efficiency and accuracy when used to constrain the wellkn ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
the wellknown Charniak parser. Additionally, we present a method for “closing ” a sufficient number of chart cells to ensure quadratic worstcase complexity of contextfree inference. Empirical results show that this O(n 2) bound can be achieved without impacting parsing accuracy. 1
Convex partitions of polyhedra: a lower bound and worstcase optimal algorithm
 SIAM J. Comput
, 1984
"... Abstract. The problem of partitioning a polyhedron into aminimum number of convex pieces is known to be NPhard. We establish here a quadratic lower bound on the complexity of this problem, and we describe an algorithm that produces a number of convex parts within a constant factor of optimal in the ..."
Abstract

Cited by 79 (3 self)
 Add to MetaCart
in the worst case. The algorithm is linear in the size of the polyhedron and cubic in the number of reflex angles. Since in most applications areas, the former quantity greatly exceeds the latter, the algorithm is viable in practice. Key words. Computational geometry, convex decompositions, data structures
On Basing LowerBounds for Learning on WorstCase Assumptions
"... We consider the question of whether P != NP implies that there exists some concept class that is efficiently representable but is still hard to learn in the PAC model of Valiant (CACM ’84), where the learner is allowed to output any efficient hypothesis approximating the concept, including an “impro ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
of the reduction in use, either (1) L has a statistical zeroknowledge argument system, or (2) the worstcase hardness of L implies the existence of a weak variant of oneway functions defined by OstrovskyWigderson (ISTCS ’93). Interestingly, we observe that the converse implication also holds. Namely, if (1
1Network Compression: WorstCase Analysis
"... We study the problem of communicating a distributed correlated memoryless source over a memoryless network, from source nodes to destination nodes, under quadratic distortion constraints. We establish the following two complementary results: (a) for an arbitrary memoryless network, among all distrib ..."
Abstract
 Add to MetaCart
We study the problem of communicating a distributed correlated memoryless source over a memoryless network, from source nodes to destination nodes, under quadratic distortion constraints. We establish the following two complementary results: (a) for an arbitrary memoryless network, among all
Results 1  10
of
64,785