2342 search results - page 392 / 469 » Sublinear geometric algorithms |
140
click to vote
ESA
2003
Springer
15 years 6 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
109
Voted
APCCAS
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper, we develop a robust bit-plane watermarking technique based on zerotree coding. A robust watermark is an imperceptible but indelible code that can be used for owners...
112
Voted
CW
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper describes how the web-based visualization can be greatly improved using the function-based shape modeling technique. The improvement is possible because the proposed fu...
107
click to vote
FOCS
2002
IEEE
15 years 5 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...
133
click to vote
PG
2002
IEEE
15 years 5 months ago
2002
IEEE
We present a novel use of commodity graphics hardware that effectively combines a plane-sweeping algorithm with view synthesis for real-time, on-line 3D scene acquisition and view...