13621 search results - page 156 / 2725 » Computability and Complexity in Self-assembly |
133
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
DCT-based CODECs such as MPEG-4 Visual and H.263 "skip" many macroblocks during encoding of typical video sequences (i.e. no coded data is transmitted for these macroblo...
165
click to vote
GD
2007
Springer
16 years 18 days ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
143
click to vote
TGC
2007
Springer
16 years 17 days ago
2007
Springer
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
160
click to vote
WG
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
185
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...