895 search results - page 86 / 179 » Using graphs for some discrete tomography problems |
143
Voted
CONSTRAINTS
2007
15 years 3 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
105
Voted
CCCG
2007
15 years 5 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
136
Voted
FUIN
2007
15 years 3 months ago
2007
The paper is concerned with algebras whose elements can be used to represent runs of a system, called processes. These algebras, called behaviour algebras, are categories with resp...
250
Voted
NLP
2000
15 years 7 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
126
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...