194 search results - page 23 / 39 » Computing Roundness is Easy if the Set is Almost Round |
152
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
196
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
240
click to vote
COLCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Geospatial tagging (geotagging) is an emerging and very promising application that can help users find a wide variety of location-specific information, and facilitate the deve...
161
click to vote
KDD
2001
ACM
16 years 6 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
159
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...