1055 search results - page 24 / 211 » order 2002 |
116
click to vote
DM
2002
15 years 4 months ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
142
click to vote
SIGKDD
2002
15 years 4 months ago
2002
In order to solve task 2 of the KDD Cup 2002, we exploited various available information sources. In particular, use of relational information describing the interactions among ge...
139
click to vote
ICDM
2002
IEEE
15 years 10 months ago
2002
IEEE
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
120
click to vote
AUTOMATICA
2002
15 years 4 months ago
2002
In this note, the problem of minimal-order stabilization in the case where the plant is minimum phase is studied. A low bound on the order of stabilizers is derived and a set of m...
147
Voted
JFLP
2002
15 years 4 months ago
2002
In this paper we extend the lazy narrowing calculus lnc of Middeldorp, Okui, and Ida [26] to conditional rewrite systems. The resulting lazy conditional narrowing calculus lcnc is...