1133 search results - page 115 / 227 » Basics of Graph Cuts |
110
click to vote
ASP
2003
Springer
15 years 3 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
106
click to vote
SSD
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
CCE
2008
14 years 10 months ago
2008
We review the use of bond graphs for modeling of physico-chemical processes. We recall that bond graphs define a circuit-type language which root on a thermodynamical consistent d...
JCT
2006
14 years 10 months ago
2006
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
NETWORKS
2011
14 years 4 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...