Sciweavers

8838 search results - page 1557 / 1768
» Generalizing Domain Theory
Sort
View
POPL
2010
ACM
16 years 3 months ago
Automatically Generating Instruction Selectors Using Declarative Machine Descriptions
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
João Dias, Norman Ramsey
POPL
2010
ACM
16 years 3 months ago
Monads in Action
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
Andrzej Filinski
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 3 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICS
2010
Tsinghua U.
16 years 3 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
EUROSYS
2006
ACM
16 years 3 months ago
Database replication policies for dynamic content applications
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
Gokul Soundararajan, Cristiana Amza, Ashvin Goel
« Prev « First page 1557 / 1768 Last » Next »