10988 search results - page 1757 / 2198 » Algorithmic Folding Complexity |
175
click to vote
CCGRID
2011
IEEE
14 years 8 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
185
click to vote
CIDR
2011
14 years 8 months ago
2011
Organizations like the Internet Archive have been capturing Web contents over decades, building up huge repositories of time-versioned pages. The timestamp annotations and the she...
253
click to vote
FOSSACS
2011
Springer
14 years 8 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
173
click to vote
POPL
2011
ACM
14 years 8 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
187
click to vote
SIGMOD
2011
ACM
14 years 8 months ago
2011
ACM
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...