4455 search results - page 96 / 891 » The family and communication technologies |
154
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
163
click to vote
GLOBECOM
2007
IEEE
16 years 19 days ago
2007
IEEE
Abstract— This paper presents a design criteria for arbitrarily low-rate parallel concatenated convolutional codes (PCCCs). The purpose of this work is to find a family of turbo...
119
click to vote
BIRTHDAY
2004
Springer
15 years 11 months ago
2004
Springer
A family of mathematical models of nondeterministic data flow is introduced. These models are constructed out of sets of traces, successes, failures and divergences, cf. Hoare’s...
174
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
168
click to vote
DLT
2010
15 years 7 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...