11740 search results - page 119 / 2348 » More Problems in Rewriting |
129
click to vote
IPCO
1993
15 years 2 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
98
Voted
IPL
2006
15 years 22 days ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
76
Voted
DSS
2007
15 years 22 days ago
2007
Abstract. In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new stochastic beam search algo...
94
Voted
SYNTHESE
2010
14 years 11 months ago
2010
In the Newcomb problem, the standard arguments for taking either one box or both boxes adduce what seem to be relevant considerations, but they are not complete arguments, and att...
75
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...