3307 search results - page 281 / 662 » The meaning of concurrent programs |
187
click to vote
PAMI
2007
15 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
185
Voted
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
We present a novel approach to interaction-oriented programming based on declaratively representing communication protocols. Our approach exhibits the following distinguishing fea...
182
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
183
click to vote
ECOOP
2004
Springer
16 years 2 days ago
2004
Springer
In this paper we present a Model for Dynamic Hyperslices which uses a particular Aspect-Oriented (AO) approach – Hyperspaces – for decomposition and reflection as a means for ...
159
click to vote
ECOOP
2004
Springer
16 years 2 days ago
2004
Springer
Module systems are well known as a means for giving clear interfaces for the static linking of code. This paper shows how adding explicit interfaces to modules for 1) dynamic linki...