635 search results - page 51 / 127 » Some Computational Problems Related to Pseudo-intents |
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
BIRTHDAY
2007
Springer
15 years 3 months ago
2007
Springer
With the Distributed File System Replication component, DFS-R, as the central theme, we present selected protocol problems and validation methods encountered during design and deve...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
CVPR
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a method for registering images at different magnifications (scales) by treating the problem not only as one of scaling the image coordinates but also as one i...