We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
ion of discrete abstractions of arbitrary memory span for nonlinear sampled systems Gunther Reißig⋆ Technische Universit¨at Berlin, Fakult¨at Elektrotechnik und Informatik, He...
Abstract—Multimedia applications for mobile devices are increasing and growing more sophisticated. Many of these applications require computationally intensive processing, such a...
Carri W. Chan, Nicholas Bambos, Jatinder Pal Singh
— Forecast, detection and warning of severe weather and related hydro-geological risks is becoming one of the major issues for civil protection. The use of computational intellig...
Erika Coppola, Barbara Tomassetti, Marco Verdecchi...