16430 search results - page 774 / 3286 » On Computable Tree Functions |
183
click to vote
SIAMDM
2008
15 years 7 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
194
click to vote
IJNSEC
2007
15 years 7 months ago
2007
This paper proposes a multipath routing scheme SeReRoM for a multicast group communication with a single source and multiple destinations. SeReRoM provides an environment that tac...
236
click to vote
CANDC
2005
ACM
15 years 7 months ago
2005
ACM
We propose an algorithm of global multiple sequence alignment that is based on a measure of what we call information discrepancy. The algorithm follows a progressive alignment ite...
195
click to vote
CRYPTO
2009
Springer
16 years 2 months ago
2009
Springer
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
194
click to vote
DATE
2006
IEEE
16 years 1 months ago
2006
IEEE
Soft errors have emerged as an important reliability challenge for nanoscale VLSI designs. In this paper, we present a fast and efficient soft error rate (SER) computation algorit...