10608 search results - page 601 / 2122 » Complexity of O'Hara's Algorithm |
184
click to vote
COLING
1990
15 years 8 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
191
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Liquid chromatography coupled to mass spectrometry (LC/MS) is an important analytical technology for e.g. metabolomics experiments. Determining the boundaries, centres...
156
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
In many physical statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpo...
183
click to vote
JACM
2002
15 years 6 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
154
click to vote
PRL
2002
15 years 6 months ago
2002
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...