109 search results - page 16 / 22 » dm 2007 |
CCCG
2004
14 years 12 months ago
2004
We prove that any given well-behaved folded state of a piece of paper can be reached via a continuous folding process starting from the unfolded paper and ending with the folded st...
PKDD
2007
Springer
15 years 4 months ago
2007
Springer
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
71
Voted
DM
2008
14 years 10 months ago
2008
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
63
Voted
HYBRID
2007
Springer
15 years 2 months ago
2007
Springer
We present a new algorithm for the reachability analysis of multi-affine hybrid systems. In our previous work on reachability analysis and that of our collaborators [1
DM
2007
14 years 10 months ago
2007
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...