Sciweavers

2783 search results - page 228 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ENTCS
2008
123views more  ENTCS 2008»
15 years 1 months ago
A Chart Semantics for the Pi-Calculus
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational se...
Johannes Borgström, Andrew D. Gordon, Andrew ...
SYNTHESE
2008
102views more  SYNTHESE 2008»
15 years 1 months ago
Epistemic comparative conditionals
The interest of epistemic comparative conditionals comes from the fact that they represent genuine `comparative epistemic relations' between propositions, situations, evidence...
Linton Wang
LOGCOM
2007
91views more  LOGCOM 2007»
15 years 1 months ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
SIGGRAPH
2010
ACM
15 years 6 months ago
RepFinder: Finding Approximately Repeated Scene Elements for Image Editing
Repeated elements are ubiquitous and abundant in both manmade and natural scenes. Editing such images while preserving the repetitions and their relations is nontrivial due to over...
Ming-Ming Cheng, Fang-Lue Zhang, Niloy J. Mitra, X...
IPL
2011
96views more  IPL 2011»
14 years 8 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay