You are currently viewing a new version of our website. To view the old version click .

Algorithms, Volume 3, Issue 3

September 2010 - 9 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (9)

  • Article
  • Open Access
12 Citations
8,954 Views
18 Pages

20 August 2010

We compare univariate L1 interpolating splines calculated on 5-point windows, on 7-point windows and on global data sets using four different spline functionals, namely, ones based on the second derivative, the first derivative, the function value an...

  • Article
  • Open Access
4 Citations
9,745 Views
17 Pages

Fluidsim: A Car Traffic Simulation Prototype Based on FluidDynamic

  • Massimiliano Caramia,
  • Ciro D’Apice,
  • Benedetto Piccoli and
  • Antonino Sgalambro

9 August 2010

We present a car traffic simulation prototype for complex networks, that is formed by a collection of roads and junctions. Traffic load evolution is described by a model based on fluid dynamic conservation laws, deduced from conservation of the numbe...

  • Article
  • Open Access
8 Citations
7,637 Views
18 Pages

30 July 2010

We analytically investigate univariate C1 continuous cubic L1 interpolating splines calculated by minimizing an L1 spline functional based on the second derivative on 5-point windows. Specifically, we link geometric properties of the data points in t...

  • Article
  • Open Access
1 Citations
7,356 Views
11 Pages

26 July 2010

The metric average is a binary operation between sets in Rn which is used in the approximation of set-valued functions. We introduce an algorithm that applies tools of computational geometry to the computation of the metric average of 2D sets with pi...

  • Article
  • Open Access
2 Citations
10,845 Views
20 Pages

12 July 2010

The algorithm of Lenstra, Lenstra, and Lovász (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of O(n) using modular arithmetic. Koy and Schnorr developed...

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Algorithms - ISSN 1999-4893