Sciweavers

632 search results - page 121 / 127
» Combining programming with theorem proving
Sort
View
IEEESCC
2009
IEEE
13 years 5 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
IJACTAICIT
2010
361views more  IJACTAICIT 2010»
13 years 5 months ago
A Proposed Technique for Information Hiding Based on DCT
The aim of this work is to design an algorithm which combines between steganography and cryptography that can hide a text in an image in a way that prevents, as much as possible, ...
Fadhil Salman Abed, Nada Abdul Aziz Mustafa
INFOCOM
2011
IEEE
12 years 11 months ago
Consort: Node-Constrained Opportunistic Routing in wireless mesh networks
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
Xi Fang, Dejun Yang, Guoliang Xue
JACM
2011
152views more  JACM 2011»
12 years 10 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
ESOP
2004
Springer
14 years 1 months ago
Trust Management in Strand Spaces: A Rely-Guarantee Method
We show how to combine trust management theories with nonce-based cryptographic protocols. The strand space framework for protocol analysis is extended by associating formulas from...
Joshua D. Guttman, F. Javier Thayer, Jay A. Carlso...