100 search results - page 10 / 20 » Spatial Partition Graphs: A Graph Theoretic Model of Maps |
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
117
click to vote
MICCAI
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
131
click to vote
JMLR
2012
13 years 3 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
104
click to vote
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
110
click to vote
GG
2008
Springer
15 years 2 months ago
2008
Springer
We present a graphical implementation for finite processes of the mobile ambients calculus. Our encoding uses unstructured (i.e., non hierarchical) graphs and it is sound and comp...