7006 search results - page 304 / 1402 » Approximation Algorithms |
115
Voted
IPL
2007
15 years 3 months ago
2007
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
197
Voted
CAD
1998
Springer
15 years 3 months ago
1998
Springer
Developable surfaces are modelled with pieces of right circular cones. These cone spline surfaces are well-suited for applications: They possess degree two parametric and implicit...
121
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...
155
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
131
click to vote
DCG
2008
15 years 4 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...