13621 search results - page 379 / 2725 » Computability and Complexity in Self-assembly |
179
click to vote
SIGACT
2008
15 years 6 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
154
click to vote
IJFCS
2007
15 years 6 months ago
2007
The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organism. Three molecular operations...
167
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
152
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
200
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...