7930 search results - page 1116 / 1586 » Greedy in Approximation Algorithms |
188
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
186
click to vote
VCIP
2003
15 years 8 months ago
2003
In order to transmit or store three-dimensional (3-D) mesh models efficiently, we need to simplify them. Although the quadric error metric (QEM) provides fast and accurate geometr...
181
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
195
click to vote
GLVLSI
2010
IEEE
15 years 7 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
163
click to vote
CGF
2010
15 years 7 months ago
2010
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...