Sciweavers

382 search results - page 52 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
POPL
2003
ACM
14 years 8 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
PEPM
2009
ACM
14 years 8 days ago
Translation and optimization for a core calculus with exceptions
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
Cristina David, Cristian Gherghina, Wei-Ngan Chin
EGC
2005
Springer
14 years 1 months ago
XDTM: The XML Data Type and Mapping for Specifying Datasets
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
Luc Moreau, Yong Zhao, Ian T. Foster, Jens-S. V&ou...
SEMCO
2007
IEEE
14 years 2 months ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth
CCS
2011
ACM
12 years 7 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta