273 search results - page 44 / 55 » A Geometric Proof of Calibration |
150
Voted
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
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...
146
click to vote
FOCS
1994
IEEE
15 years 9 months ago
1994
IEEE
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...
177
Voted
STOC
2009
ACM
16 years 6 months ago
2009
ACM
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 ...
168
Voted
ICCCN
2008
IEEE
16 years 4 days ago
2008
IEEE
—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...
185
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
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...