Sciweavers

24 search results - page 5 / 5
» User-Input Dependence Analysis via Graph Reachability
Sort
View
SIGSOFT
2002
ACM
14 years 5 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
IPPS
2009
IEEE
13 years 11 months ago
Toward adjoinable MPI
4 Automatic diļ¬€erentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
Jean Utke, Laurent Hascoët, Patrick Heimbach,...
BMCBI
2010
144views more  BMCBI 2010»
13 years 5 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 5 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky