Result 1 to 13 of 13 total
How to construct polar codes. (English)
Comput. Res. Repos. 2011, Article No. 1105.6164 (2011).
1
Convex programming upper bounds on the capacity of 2-D constraints (English)
IEEE Transactions on Information Theory 57, No. 1, 381-391 (2011).
2
Hardware architectures for successive cancellation decoding of polar codes (English)
ICASSP, 1665-1668 (2011).
3
Bounds on the rate of 2-D bit-stuffing encoders (English)
IEEE Transactions on Information Theory 56, No. 6, 2561-2567 (2010).
4
Bounds on the rate of 2-D bit-stuffing encoders. (English)
Comput. Res. Repos. 2009, Article No. 0906.2372 (2009).
5
Simulating reachability using first-order logic with applications to verification of linked data structures. (English)
Log. Methods Comput. Sci. 5, No. 2, Paper 12, 30 p., electronic only (2009).
6
On row-by-row coding for 2-D constraints (English)
IEEE Transactions on Information Theory 55, No. 8, 3565-3576 (2009).
7
On row-by-row coding for 2-D constraints. (English)
Comput. Res. Repos. 2008, Article No. 0808.0596 (2008).
8
Concave programming upper bounds on the capacity of 2-D constraints. (English)
Comput. Res. Repos. 2008, Article No. 0801.1126 (2008).
9
Abstraction for shape analysis with fast and precise transformers. (English)
Ball, Thomas (ed.) et al., Computer aided verification. 18th international conference, CAV 2006, Seattle, WA, USA, August 17‒20, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37406-X/pbk). Lecture Notes in Computer Science 4144, 547-561 (2006).
10
Abstraction for shape analysis with fast and precise transformers (English)
CAV, 547-561 (2006).
11
Simulating reachability using first-order logic with applications to verification of linked data structures (English)
CADE, 99-115 (2005).
12
Skew detection via principal components analysis (English)
ICDAR, 153-156 (1999).
13
Result 1 to 13 of 13 total
Start
Contact
Print
General Help
