2262 search results - page 129 / 453 » Points with large quadrant-depth |
155
click to vote
CDB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
174
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
179
click to vote
PKC
1998
Springer
15 years 10 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
183
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level s...
176
click to vote
NSDI
2007
15 years 8 months ago
2007
: The physical locations of clients and access points in a wireless LAN may have a large impact on network performance. However, today’s WLAN management tools do not provide info...