CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present recent results from the LCDM3 collaboration between UIUC Astronomy and NCSA to deploy supercomputing cluster resources and machine learning algorithms for the mining of ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We present here a first prototype of a "Speed Limit Support" Advance Driving Assistance System (ADAS) producing permanent reliable information on the current speed limit...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert va...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The hairpin completion is a natural operation on formal languages which has been inspired by biochemistry and DNA-computing. In this paper we solve two problems which were posed f...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
