1333 search results - page 45 / 267 » Not a Number of Floating Point Problems |
143
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
155
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
193
Voted
CORR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
144
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
132
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Horizons are visible boundaries between certain sediment layers in seismic data, and a fault is a crack of horizons and it is recognized in seismic data by the discontinuities of ...