662 search results - page 21 / 133 » Cheap and Fast - But is it Good |
139
click to vote
MOC
1998
15 years 5 months ago
1998
We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = n1>n2>...>nd 1 ns1 1 ns2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finit...
149
click to vote
ICDAR
2009
IEEE
16 years 8 days ago
2009
IEEE
In this paper, we present a new incremental learning strategy for handwritten character recognition systems. This learning strategy enables the recognition system to learn “rapi...
150
click to vote
SIES
2009
IEEE
16 years 8 days ago
2009
IEEE
—The performance estimation of complex multi-processor systems-on-chip (MPSoC) in a reasonable amount of time and with a good accuracy becomes more and more challenging due to th...
154
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Previously either due to hardware GPU limits or older versions of software, careful implementation of PRNGs was required to make good use of the limited numerical precision availa...
144
click to vote
DAC
1989
ACM
15 years 9 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...