Sciweavers

1445 search results - page 32 / 289
» Uniformly Hard Languages
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Runtime support for multicore Haskell
Purely functional programs should run well on parallel hardware because of the absence of side effects, but it has proved hard to realise this potential in practice. Plenty of pap...
Simon Marlow, Simon L. Peyton Jones, Satnam Singh
DCC
2008
IEEE
14 years 7 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
ICALP
2007
Springer
14 years 1 months ago
Estimating Sum by Weighted Sampling
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
CADE
2001
Springer
14 years 8 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
SOSP
2009
ACM
14 years 4 months ago
Helios: heterogeneous multiprocessing with satellite kernels
Helios is an operating system designed to simplify the task of writing, deploying, and tuning applications for heterogeneous platforms. Helios introduces satellite kernels, which ...
Edmund B. Nightingale, Orion Hodson, Ross McIlroy,...