Results 1  10
of
108,835
A Subcubic Time Algorithm for the kMaximum Subarray Problem
"... Abstract. We design a faster algorithm for the kmaximum subarray problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n 3 √ log log n/log n + k log n) for a general problem where overlapping is allowed for solution arrays. This complexi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We design a faster algorithm for the kmaximum subarray problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n 3 √ log log n/log n + k log n) for a general problem where overlapping is allowed for solution arrays
Linköping: Cubictime graph parsing with a simple scoring scheme
 SemEval
, 2014
"... We turn the Eisner algorithm for parsing to projective dependency trees into a cubictime algorithm for parsing to a restricted class of directed graphs. To extend the algorithm into a datadriven parser, we combine it with an edgefactored feature model and online learning. We report and discuss r ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We turn the Eisner algorithm for parsing to projective dependency trees into a cubictime algorithm for parsing to a restricted class of directed graphs. To extend the algorithm into a datadriven parser, we combine it with an edgefactored feature model and online learning. We report and discuss
Open Access
"... A subcubic time algorithm for computing the quartet distance between two general trees ..."
Abstract
 Add to MetaCart
A subcubic time algorithm for computing the quartet distance between two general trees
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
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.
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]
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
Cubictime Parsing and Learning Algorithms for Grammatical Bigram Models
, 2001
"... This technical report presents a probabilistic model of English grammar that is based upon \grammatical bigrams", i.e., syntactic relationships between pairs of words. Because of its simplicity, the grammatical bigram model admits cubictime parsing and unsupervised learning algorithms, which a ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
This technical report presents a probabilistic model of English grammar that is based upon \grammatical bigrams", i.e., syntactic relationships between pairs of words. Because of its simplicity, the grammatical bigram model admits cubictime parsing and unsupervised learning algorithms, which
Results 1  10
of
108,835