27 search results - page 5 / 6 » csr 2006 |
CSR
2006
Springer
14 years 1 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
CSR
2006
Springer
14 years 1 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
CSR
2006
Springer
14 years 1 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
CSR
2006
Springer
14 years 1 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
HICSS
2008
IEEE
14 years 4 months ago
2008
IEEE
On September 5, 2006, a legal precedent was set for web accessibility. Federal judge Marilyn Patel sustained discrimination claims by the National Federation for the Blind against...