40212 search results - page 7803 / 8043 » More |
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
124
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this and the associated article BioBlender: A Software for Intuitive Representation of Surface Properties of Biomolecules [1], we present BioBlender as a complete instrument fo...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...