Sciweavers

1888 search results - page 160 / 378
» Proof theory and computational analysis
Sort
View
89
Voted
EXPCS
2007
15 years 4 months ago
An analysis of XML compression efficiency
XML simplifies data exchange among heterogeneous computers, but it is notoriously verbose and has spawned the development of many XML-specific compressors and binary formats. We p...
Christopher J. Augeri, Dursun A. Bulutoglu, Barry ...
95
Voted
ICEGOV
2009
ACM
15 years 7 months ago
Framework of e-governance at the local government level
With presumptions that e-government theories prevail in various formats and concepts around the globe, nations and institutions, not many examples are there to emulate in terms of...
Hakikur Rahman
95
Voted
IANDC
2006
97views more  IANDC 2006»
15 years 21 days ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
TLDI
2010
ACM
190views Formal Methods» more  TLDI 2010»
15 years 9 months ago
Distributed programming with distributed authorization
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...
Kumar Avijit, Anupam Datta, Robert Harper
93
Voted
EUROCRYPT
2005
Springer
15 years 6 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...