7930 search results - page 485 / 1586 » Greedy in Approximation Algorithms |
324
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
209
click to vote
3DIM
2003
IEEE
15 years 10 months ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
154
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
188
click to vote
ISAAC
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
209
click to vote
WAOA
2005
Springer
16 years 12 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...