Sciweavers

2227 search results - page 36 / 446
» Reversibility and Models for Concurrency
Sort
View
KBSE
1997
IEEE
14 years 2 months ago
A Formal Automated Approach for Reverse Engineering Programs with Pointers
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
Gerald C. Gannod, Betty H. C. Cheng
NIPS
2000
13 years 11 months ago
On Reversing Jensen's Inequality
Jensen's inequality is a powerful mathematical tool and one of the workhorses in statistical learning. Its applications therein include the EM algorithm, Bayesian estimation ...
Tony Jebara, Alex Pentland
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 10 months ago
Context for models of concurrency
Many categories have been used to model concurrency. Using any of these, the challenge is to reduce a given model to a smaller representation which nevertheless preserves the relev...
Peter Bubenik
INFOCOM
2006
IEEE
14 years 3 months ago
Utility-Optimal Medium Access Control: Reverse and Forward Engineering
— This paper analyzes and designs medium access control (MAC) protocols for wireless ad-hoc networks through the network utility maximization (NUM) framework. We first reverse-e...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank
CVPR
2007
IEEE
14 years 12 months ago
Probabilistic Reverse Annotation for Large Scale Image Retrieval
Automatic annotation is an elegant alternative to explicit recognition in images. In annotation, the image is matched with keyword models, and the most relevant keywords are assig...
K. Pramod Sankar, C. V. Jawahar