6274 search results - page 252 / 1255 » From query complexity to computational complexity |
126
click to vote
CIE
2007
Springer
15 years 11 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
128
Voted
ICRA
2006
IEEE
15 years 11 months ago
2006
IEEE
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
168
click to vote
PVLDB
2008
15 years 4 months ago
2008
The number of potentially-related data resources available for querying -- databases, data warehouses, virtual integrated schemas -continues to grow rapidly. Perhaps no area has s...
196
click to vote
STAIRS
2008
15 years 6 months ago
2008
This paper presents an extensive evaluation, on artificial datasets, of EDY, an unsupervised algorithm for automatically synthesizing a Structured Hidden Markov Model (S-HMM) from ...
127
Voted
ACL
1993
15 years 6 months ago
1993
Overgeneration is the main source of computational complexity in previous principle-based parsers. This paper presents a message passing algorithm for principle-based parsing that...