874 search results - page 109 / 175 » Faster Algorithms for Semi-Matching Problems |
BIRTHDAY
1994
Springer
15 years 2 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
CP
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
104
click to vote
FPGA
1995
ACM
15 years 1 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
AAAI
2008
15 years 7 days ago
2008
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
CHI
2008
ACM
14 years 12 months ago
2008
ACM
Many mobile devices have touch-sensitive screens that people interact with using fingers or thumbs. However, such interaction is difficult because targets become occluded, and bec...