Sciweavers

1322 search results - page 236 / 265
» Efficient Goal-Directed Exploration
Sort
View
POPL
2008
ACM
14 years 10 months ago
Demand-driven alias analysis for C
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
Xin Zheng, Radu Rugina
RECOMB
2004
Springer
14 years 10 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
OSDI
2002
ACM
14 years 10 months ago
CMC: A Pragmatic Approach to Model Checking Real Code
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
Madanlal Musuvathi, David Y. W. Park, Andy Chou, D...
SIGMOD
2009
ACM
125views Database» more  SIGMOD 2009»
14 years 10 months ago
Top-k queries on uncertain data: on score distribution and typical answers
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
Tingjian Ge, Stanley B. Zdonik, Samuel Madden
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 10 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...