75 search results - page 5 / 15 » On Times to Compute Shapes in 2D Tile Self-assembly |
ICS
2010
Tsinghua U.
13 years 10 months ago
2010
Tsinghua U.
We present a new cache oblivious scheme for iterative stencil computations that performs beyond system bandwidth limitations as though gigabytes of data could reside in an enormou...
ICCV
1998
IEEE
14 years 7 months ago
1998
IEEE
Existing object tracking algorithms generally use some form of local optimisation, assuming that an object's position and shape change smoothly over time. In some situations ...
JISE
1998
13 years 5 months ago
1998
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. We build upon recent results by ...
CCCG
2009
13 years 6 months ago
2009
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
ICCS
2007
Springer
13 years 11 months ago
2007
Springer
We present a Dynamic Data Driven Application System (DDDAS) to track 2D shapes across large pose variations by learning non-linear shape manifold as overlapping, piecewise linear s...