1686 search results - page 232 / 338 » Programs as polygraphs: computability and complexity |
132
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
145
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
152
click to vote
ASPLOS
2008
ACM
15 years 6 months ago
2008
ACM
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
118
Voted
DAC
2009
ACM
16 years 5 months ago
2009
ACM
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and manycore microprocessors have the potential to offer scalable perf...
134
click to vote
ICCD
2007
IEEE
16 years 29 days ago
2007
IEEE
Software integrity and confidentiality play a central role in making embedded computer systems resilient to various malicious actions, such as software attacks; probing and tamper...