Sciweavers

513 search results - page 98 / 103
» How digital libraries can support e-learning
Sort
View
86
Voted
SIGSOFT
2007
ACM
15 years 10 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
81
Voted
SIGSOFT
2003
ACM
15 years 10 months ago
Tracking pointers with path and context sensitivity for bug detection in C programs
This paper proposes a pointer alias analysis for automatic error detection. State-of-the-art pointer alias analyses are either too slow or too imprecise for finding errors in real...
V. Benjamin Livshits, Monica S. Lam
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
15 years 10 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
POPL
2003
ACM
15 years 9 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
172
Voted
SIGMOD
2008
ACM
159views Database» more  SIGMOD 2008»
15 years 9 months ago
Bootstrapping pay-as-you-go data integration systems
Data integration systems offer a uniform interface to a set of data sources. Despite recent progress, setting up and maintaining a data integration application still requires sign...
Anish Das Sarma, Xin Dong, Alon Y. Halevy