13621 search results - page 181 / 2725 » Computability and Complexity in Self-assembly |
188
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
141
click to vote
SIBGRAPI
2005
IEEE
16 years 2 days ago
2005
IEEE
This paper presents a linear complexity method for real-time stereo matching, in which the processing time is only dependent on the image resolution. Regions along each epipolar l...
193
click to vote
RT
2004
Springer
15 years 12 months ago
2004
Springer
We introduce a tiled 3D MIP map representation of global illumination data. The representation is an adaptive, sparse octree with a “brick” at each octree node; each brick con...
170
click to vote
ARITH
2003
IEEE
15 years 11 months ago
2003
IEEE
Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel systolic multiplier over GF(2m ) which has a low hardware complexity and a low latenc...
161
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...