455 search results - page 44 / 91 » A local approximation algorithm for maximum weight matching |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
101
click to vote
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
NIPS
1994
14 years 11 months ago
1994
For many types of machine learning algorithms, one can compute the statistically optimal" way to select training data. In this paper, we review how optimal data selection tec...
131
Voted
MM
2010
ACM
14 years 10 months ago
2010
ACM
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and object recognition. However, such descriptors are typically of ...
75
Voted
ISLPED
2005
ACM
15 years 3 months ago
2005
ACM
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...