Sciweavers

273 search results - page 44 / 55
» A Geometric Proof of Calibration
Sort
View
FOCS
2002
IEEE
14 years 1 months ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir
FOCS
1994
IEEE
14 years 17 days ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 9 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
ICCCN
2008
IEEE
14 years 2 months ago
A Position-Based Deployment and Routing Approach for Directional Wireless Mesh Networks
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
Weisheng Si, Selvakennedy Selvadurai
IBPRIA
2003
Springer
14 years 1 months ago
Reconstruction of Quadrics from Two Polarization Views
Abstract. This paper addresses the problem of reconstructing textureless objects of quadric like shape. It is known that a quadric can be uniquely recovered from its apparent conto...
Stefan Rahmann