Results 1  10
of
270,112
ControlFlow Analysis in Cubic Time
 ELECTRONIC NOTES OF THEORETICAL COMPUTER SCIENCE
, 2001
"... The spicalculus is a variant of the polyadic sscalculus that admits symmetric cryptography and that admits expressing communication protocols in a precise though still abstract way. This paper shows that contextindependent control flow analysis can be calculated in cubic time despite the fact th ..."
Abstract

Cited by 36 (13 self)
 Add to MetaCart
The spicalculus is a variant of the polyadic sscalculus that admits symmetric cryptography and that admits expressing communication protocols in a precise though still abstract way. This paper shows that contextindependent control flow analysis can be calculated in cubic time despite the fact
General ContextFree Recognition in Less than Cubic Time
 Journal of Computer and System Sciences
, 1975
"... General contextfree recognition in less than cubic time ..."
Abstract

Cited by 86 (0 self)
 Add to MetaCart
General contextfree recognition in less than cubic time
ControlFlow Analysis in Cubic Time
, 2001
"... It is wellknown that contextindependent control flow analysis can be performed in cubic time for functional and objectoriented languages. Yet recent applications of control flow analysis to calculi of computation (like the #calculus and the ambient calculus) have reported considerably higher com ..."
Abstract
 Add to MetaCart
It is wellknown that contextindependent control flow analysis can be performed in cubic time for functional and objectoriented languages. Yet recent applications of control flow analysis to calculi of computation (like the #calculus and the ambient calculus) have reported considerably higher
Bilexical Grammars And Their CubicTime Parsing Algorithms
 IN: NEW DEVELOPMENTS IN NATURAL LANGUAGE PARSING
, 2000
"... This chapter introduces weighted bilexical grammars, a formalism in which individual lexical items, such as verbs and their arguments, can have idiosyncratic selectional influences on each other. Such ‘bilexicalism ’ has been a theme of much current work in parsing. The new formalism can be used t ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
to describe bilexical approaches to both dependency and phrasestructure grammars, and a slight modification yields link grammars. Its scoring approach is compatible with a wide variety of probability models. The obvious parsing algorithm for bilexical grammars (used by most previous authors) takes time O(n^5
Bilexical Grammars and a CubicTime Probabilistic Parser
 In Proc. of Int’l Workshop on Parsing Technologies
, 1997
"... Computational linguistics has a long tradition of lexicalized grammars, in which each grammatical rule is specialized for some individual word. The earliest lexicalized rules were wordspecific subcategorization frames. It is now common to find fully lexicalized versions of many grammatical formalis ..."
Abstract

Cited by 52 (8 self)
 Add to MetaCart
Computational linguistics has a long tradition of lexicalized grammars, in which each grammatical rule is specialized for some individual word. The earliest lexicalized rules were wordspecific subcategorization frames. It is now common to find fully lexicalized versions of many grammatical formalisms, such as contextfree and treeadjoining grammars [Schabes et al. 1988]. Other formalisms, such as dependency grammar [Mel’čuk 1988]
Persistence algorithm takes cubic time in worst case
 BioGeometry News, Dept. Comput. Sci., Duke Univ
, 2005
"... Given a sequence of N simplices, we consider the sequence of sets Ki consisting of the first i simplices, for 1 ≤ i ≤ N. We call the sequence of Ki a filtration if all the Ki are simplicial complexes. In this note, we describe a filtration of a simplicial complex of N simplices on which the algorith ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
the algorithm PairSimplices of Edelsbrunner, Letscher and Zomorodian [1] performs Ω(N 3) operations. The existence of this filtration should be contrasted to the experimentally observed only slightly superlinear running time for filtrations that arise from applications. We describe the space as well
The flooding time synchronization protocol
, 2004
"... Abstract Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper introduces the robust Flooding Time Synchronization Protocol (FTSP), especially tailored for applicatio ..."
Abstract

Cited by 463 (15 self)
 Add to MetaCart
Abstract Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. This paper introduces the robust Flooding Time Synchronization Protocol (FTSP), especially tailored
nFold integer programming in cubic time
, 2013
"... nFold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variabledimension, parametrization of all of integer programming. The fastest algorithm for nfold integer programming pr ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
predating the present article runs in time O ng(A)L with L the binary length of the numerical part of the input and g(A) the socalled Graver complexity of the bimatrix A defining the system. In this article we provide a drastic improvement and establish an algorithm which runs in time O n3L having cubic
Recognizing holefree 4map graphs in cubic time
 Algorithmica
"... We present a cubictime algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at most four countries meet at any point. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a cubictime algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at most four countries meet at any point.
Computing Refined Buneman Trees in Cubic Time
 In Proceedings of the WABI 2003, Budapest, Hungary LNCS 2812
, 2002
"... Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance based tree reconstruction method. It always proposes fully resolved binary trees despite missing evidence in ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
proposed edge. The currently best algorithm for computing the refined Buneman tree from a given distance measure has a running time of O(n^5) and a space consumption of O(n^4). In this paper, we present an algorithm with running time O(n³) and space consumption O(n²).
Results 1  10
of
270,112