Results 1  10
of
357
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 437 (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.
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
Worstcase ValueatRisk of nonlinear portfolios
 Management Science
, 2013
"... Abstract Portfolio optimization problems involving ValueatRisk (VaR) are often computationally intractable and require complete information about the return distribution of the portfolio constituents, which is rarely available in practice. These difficulties are compounded when the portfolio cont ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
linear orby using a deltagamma approximationas (possibly nonconvex) quadratic functions of the returns of the derivative underliers. These models lead to new WorstCase Polyhedral VaR (WPVaR) and WorstCase Quadratic VaR (WQVaR) approximations, respectively. WPVaR serves as a VaR approximation
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
Worstcase Quadratic Loss Bounds for Online Prediction of Linear Functions by Gradient Descent
 IEEE Transactions on Neural Networks
, 1993
"... this paper we study the performance of gradient descent when applied to the problem of online linear prediction in arbitrary inner product spaces. We show worstcase bounds on the sum of the squared prediction errors under various assumptions concerning the amount of a priori information about the ..."
Abstract

Cited by 33 (10 self)
 Add to MetaCart
this paper we study the performance of gradient descent when applied to the problem of online linear prediction in arbitrary inner product spaces. We show worstcase bounds on the sum of the squared prediction errors under various assumptions concerning the amount of a priori information about
Worstcase Quadratic Loss Bounds for Prediction Using Linear Functions and Gradient Descent
, 1996
"... In this paper we study the performance of gradient descent when applied to the problem of online linear prediction in arbitrary inner product spaces. We show worstcase bounds on the sum of the squared prediction errors under various assumptions concerning the amount of a priori information about t ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
In this paper we study the performance of gradient descent when applied to the problem of online linear prediction in arbitrary inner product spaces. We show worstcase bounds on the sum of the squared prediction errors under various assumptions concerning the amount of a priori information about
Efficient DesignSpecific WorstCase Corner Extraction for Integrated Circuits
, 2009
"... While statistical analysis has been considered as an important tool for nanoscale integrated circuit design, many IC designers would like to know the designspecific worstcase corners for circuit debugging and failure diagnosis. In this paper, we propose a novel algorithm to efficiently extract the ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
the worstcase corners for nanoscale ICs. Our proposed approach mathematically formulates a quadratically constrained quadratic programming (QCQP) problem for corner extraction. Next, it applies the Lagrange duality theory to convert the nonconvex QCQP problem to a convex semidefinite programming (SDP
An Old SubQuadratic Algorithm for Finding Extremal Sets
, 1994
"... Some previously proposed algorithms are reexamined. They were designed to find all sets in a collection that have no subset in the collection, but are easily modified to find all sets that have no supersets. One is shown to have a worstcase runningtime of O(N 2 = log N ), where N is the sum of ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
of the sizes of all the sets. This is lower than the only previously known subquadratic worstcase upper bound for this problem. Key words: Analysis of algorithms, settheoretic algorithms, extremal sets. 1 Introduction Yellin and Jutla [3] tackled the following fundamental problem, for some applications
Results 1  10
of
357