4047 search results - page 241 / 810 » The Discrete Basis Problem |
132
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
136
click to vote
STACS
2001
Springer
15 years 8 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
155
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
102
click to vote
CVPR
1997
IEEE
15 years 8 months ago
1997
IEEE
A novel scene reconstruction technique is presented, different from previous approaches in its ability to cope with large changes in visibility and its modeling of intrinsic scene...
123
click to vote
JCDCG
1998
Springer
15 years 8 months ago
1998
Springer
In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same...