4860 search results - page 404 / 972 » SNPs Problems, Complexity, and Algorithms |
121
click to vote
CSUR
2004
15 years 3 months ago
2004
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
122
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
132
Voted
ISVLSI
2002
IEEE
15 years 8 months ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
127
Voted
IPL
2008
15 years 3 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
121
Voted
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...