4315 search results - page 64 / 863 » Sorting in linear time |
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
IWANN
1999
Springer
13 years 12 months ago
1999
Springer
A crucial problem in non-linear time series forecasting is to determine its auto-regressive order, in particular when the prediction method is non-linear. We show in this paper tha...
SIAMDM
2002
13 years 7 months ago
2002
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
ICCV
1999
IEEE
14 years 9 months ago
1999
IEEE
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
We present a tableau-based algorithm for obtaining a B