1604 search results - page 175 / 321 » Approximation algorithms for developable surfaces |
114
click to vote
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
151
click to vote
TACAS
1997
Springer
15 years 5 months ago
1997
Springer
In this paper, we describe the computer tool Design CPN supporting editing, simulation, and state space analysis of Coloured Petri Nets. So far, approximately 40 man-years have bee...
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
114
click to vote
GD
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
104
click to vote
SIROCCO
2004
15 years 3 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...