13987 search results - page 491 / 2798 » The Two Guards Problem |
164
click to vote
DAM
2006
15 years 7 months ago
2006
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
208
click to vote
IVC
2008
15 years 7 months ago
2008
In this work, we propose an original method of resolution of the shape from shading problem, which is accurate and converges with a few iterations. It relies on two simple ideas. ...
146
click to vote
ENDM
2007
15 years 7 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
190
click to vote
MOR
2008
15 years 7 months ago
2008
In this paper, we consider two geometric optimization problems that are dual to each other and characterize conditions under which the optimal values of the two problems are equal...
211
click to vote
IANDC
2007
15 years 7 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...