7006 search results - page 429 / 1402 » Approximation Algorithms |
146
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
127
click to vote
ICIP
2001
IEEE
16 years 6 months ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
144
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
159
click to vote
ESA
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
142
click to vote
DAGSTUHL
2007
2007
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms
15 years 6 months ago
We survey on theoretical properties and algorithms concerning the problem of solving a nonsymmetric algebraic Riccati equation, and we report on some known methods and new algorit...