325 search results - page 62 / 65 » Proofs of Restricted Shuffles |
SIGUCCS
2000
ACM
14 years 1 months ago
2000
ACM
Basic approaches to computer lab management range along a spectrum from total lockdown of lab computers to total freedom. Total lockdown, which can be implemented with system perm...
ECCV
2010
Springer
14 years 6 days ago
2010
Springer
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a...
CRYPTO
2008
Springer
13 years 11 months ago
2008
Springer
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
JAC
2008
13 years 11 months ago
2008
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...