828 search results - page 72 / 166 » Bounded Hairpin Completion |
STOC
2005
ACM
14 years 10 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
AIPS
2010
14 years 13 days ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
ICIP
1994
IEEE
14 years 11 months ago
1994
IEEE
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
CADE
2007
Springer
14 years 10 months ago
2007
Springer
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
CADE
2002
Springer
14 years 10 months ago
2002
Springer
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...