2446 search results - page 287 / 490 » Choiceless Polynomial Time |
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
CRYPTO
2010
Springer
13 years 4 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
TACAS
2012
Springer
12 years 3 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...