Sciweavers

132 search results - page 14 / 27
» Graph limits and hereditary properties
Sort
View
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 9 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
IPAW
2010
13 years 7 months ago
Janus: From Workflows to Semantic Provenance and Linked Open Data
Data provenance graphs are form of metadata that can be used to establish a variety of properties of data products that undergo sequences of transformations, typically specified as...
Paolo Missier, Satya Sanket Sahoo, Jun Zhao, Carol...
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
14 years 1 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...
CP
2009
Springer
14 years 10 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
ECCV
2010
Springer
14 years 3 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...