17770 search results - page 2987 / 3554 » A Generalization of Forward-Backward Algorithm |
347
click to vote
POPL
2007
ACM
16 years 7 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
352
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
310
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
309
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
289
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggr...