4385 search results - page 635 / 877 » Abstraction for Concurrent Objects |
156
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
164
click to vote
FOIS
2010
15 years 8 months ago
2010
Abstract. Taking for granted an ontological standpoint independent of any empirical or epistemological perspective, philosophical theories of properties are actually quite rarely a...
199
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
167
click to vote
EON
2007
15 years 8 months ago
2007
Abstract. Watson is a gateway to the Semantic Web: it collects, analyzes and gives access to ontologies and semantic data available online with the objective of supporting their dy...
193
click to vote
ESANN
2007
15 years 8 months ago
2007
Abstract. Given an appropriate imaging resolution, a common Magnetic Resonance Imaging (MRI) model assumes that object under study is composed of piecewise constant materials, so t...