3105 search results - page 321 / 621 » The Path-Packing Structure of Graphs |
226
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
180
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
184
click to vote
ICANN
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Belief propagation (BP) is the calculation method which enables us to obtain the marginal probabilities with a tractable computational cost. BP is known to provide true m...
207
click to vote
MEMBRANE
2004
Springer
16 years 18 days ago
2004
Springer
LMNtal (pronounced “elemental”) is a simple language model based on graph rewriting that uses logical variables to represent links and membranes to represent hierarchies. The ...
154
click to vote
ICIP
2002
IEEE
16 years 6 days ago
2002
IEEE
Three methods for extraction and quantitative measurement of features in CT and MR images are examined: hand tracing, semi-automated tracing using the livewire graph search algori...