1883 search results - page 106 / 377 » Ordered theta graphs |
179
Voted
ICPR
2008
IEEE
16 years 15 days ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
136
click to vote
ICPR
2008
IEEE
16 years 15 days ago
2008
IEEE
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
198
click to vote
ASP
2003
Springer
15 years 11 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...
164
click to vote
EUROMICRO
1998
IEEE
15 years 10 months ago
1998
IEEE
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
177
click to vote
SSD
1997
Springer
15 years 10 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...