448 search results - page 85 / 90 » Dynamic Algorithms for the Dyck Languages |
LFP
1992
14 years 10 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
114
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
138
click to vote
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
120
click to vote
CP
2003
Springer
15 years 2 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
102
click to vote
COCO
1994
Springer
15 years 1 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...