2529 search results - page 134 / 506 » The Logical Structure of Binding |
187
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
274
Voted
SAC
2010
ACM
16 years 1 months ago
2010
ACM
During the last decade national archives, libraries, museums and companies started to make their records, books and files electronically available. In order to allow efficient ac...
187
Voted
SIGIR
1996
ACM
15 years 11 months ago
1996
ACM
The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities a...
193
Voted
BMCBI
2002
15 years 6 months ago
2002
Background: Total sequence decomposition, using the web-based MASIA tool, identifies areas of conservation in aligned protein sequences. By structurally annotating these motifs, t...
197
Voted
PODS
2007
ACM
16 years 7 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...