Sciweavers

1589 search results - page 243 / 318
» Constraints with Variables' Annotations
Sort
View
ESOP
2009
Springer
14 years 4 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
PLDI
2003
ACM
14 years 3 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
SIGIR
2008
ACM
13 years 10 months ago
Learning from labeled features using generalized expectation criteria
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...
Gregory Druck, Gideon S. Mann, Andrew McCallum
BMCBI
2004
200views more  BMCBI 2004»
13 years 9 months ago
ABC: software for interactive browsing of genomic multiple sequence alignment data
Background: Alignment and comparison of related genome sequences is a powerful method to identify regions likely to contain functional elements. Such analyses are data intensive, ...
Gregory M. Cooper, Senthil A. G. Singaravelu, Aren...
WWW
2007
ACM
14 years 10 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...