2342 search results - page 52 / 469 » Sublinear geometric algorithms |
STOC
2004
ACM
16 years 28 days ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
90
Voted
CAD
2006
Springer
15 years 20 days ago
2006
Springer
We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the featu...
119
click to vote
ICCV
2005
IEEE
16 years 2 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
74
Voted
CORR
2007
Springer
15 years 18 days ago
2007
Springer
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
115
Voted
IS
2007
15 years 16 days ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...