Sciweavers

500 search results - page 89 / 100
» Quantified Conditionals and Compositionality
Sort
View
SIGSOFT
2010
ACM
13 years 5 months ago
Realizability analysis for message-based interactions using shared-state projections
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
Sylvain Hallé, Tevfik Bultan
GLOBECOM
2009
IEEE
13 years 5 months ago
Coding Strategies for Bidirectional Relaying for Arbitrarily Varying Channels
In this work we study optimal coding strategies for bidirectional relaying under the condition of arbitrarily varying channels. We consider a three-node network where a relay node ...
Rafael F. Wyrembelski, Igor Bjelakovic, Holger Boc...
CVPR
2011
IEEE
13 years 3 months ago
High Level Describable Attributes for Predicting Aesthetics and Interestingness
With the rise in popularity of digital cameras, the amount of visual data available on the web is growing exponentially. Some of these pictures are extremely beautiful and aesthet...
Sagnik Dhar, Vicente Ordonez, Tamara Berg
PLDI
2012
ACM
11 years 10 months ago
JANUS: exploiting parallelism via hindsight
This paper addresses the problem of reducing unnecessary conflicts in optimistic synchronization. Optimistic synchronization must ensure that any two concurrently executing trans...
Omer Tripp, Roman Manevich, John Field, Mooly Sagi...
PODS
2007
ACM
142views Database» more  PODS 2007»
14 years 7 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...