642 search results - page 92 / 129 » corr 2006 |
88
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
86
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
95
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
91
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...
91
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Previous studies on program comprehension were carried out largely in the context of procedural languages. Our purpose is to develop and evaluate a cognitive model of object-orient...