89222 search results - page 17514 / 17845 » Which |
150
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
119
click to vote
CORR
2010
Springer
15 years 2 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...
134
click to vote
CORR
2010
Springer
15 years 2 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 ...
132
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is ...
137
click to vote
CORR
2010
Springer
15 years 2 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...