4047 search results - page 221 / 810 » The Discrete Basis Problem |
136
click to vote
FORMATS
2004
Springer
15 years 9 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
121
click to vote
JCDCG
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
116
Voted
COMPGEOM
1997
ACM
15 years 8 months ago
1997
ACM
Within industrial contexts, a common view of the level of confidence needed in CAD data transfer processes may be expressed as “1 don’t mind if the [CAD data- tmnsfer] algorit...
138
click to vote
PADS
1997
ACM
15 years 8 months ago
1997
ACM
Large-scale ecological simulations are natural candidates for distributed discrete event simulation. In optimistic simulation of spatially explicit models, a difficult problem ar...
122
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...