51692 search results - page 10191 / 10339 » it 2008 |
142
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
121
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...
154
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
142
click to vote
CPM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
141
click to vote
CRYPTO
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...