Sciweavers

45 search results - page 9 / 9
» Extending GQM by Argument Structures
Sort
View
ICFP
2005
ACM
14 years 5 months ago
AtomCaml: first-class atomicity via rollback
We have designed, implemented, and evaluated AtomCaml, an extension to Objective Caml that provides a synchronization primitive for atomic (transactional) execution of code. A fir...
Michael F. Ringenburg, Dan Grossman
MKWI
2008
156views Business» more  MKWI 2008»
13 years 6 months ago
Enabling Open Innovation in a World of Ubiquitous Computing - Proposing a Research Agenda
: This article proposes a new Ubiquitous Computing (UC) infrastructure for open access to object data that will come along with a new research agenda especially for the field of Wi...
Detlef Schoder, Christian Schmitt, Kai Fischbach, ...
APLAS
2010
ACM
13 years 5 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
JMLR
2010
105views more  JMLR 2010»
13 years 3 days ago
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propos...
Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan
TIT
2010
136views Education» more  TIT 2010»
13 years 18 hour ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra