1333 search results - page 90 / 267 » Not a Number of Floating Point Problems |
144
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
150
Voted
SWAT
2010
Springer
15 years 8 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
114
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
133
Voted
HYBRID
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...
139
Voted
DICTA
2003
15 years 5 months ago
2003
This paper describes a novel approach to the problem of recovering information from an image set by comparing the radiance of hypothesised point correspondences. This method is app...