6562 search results - page 102 / 1313 » Noetherianity and Combination Problems |
120
click to vote
IPL
2007
15 years 4 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-...
144
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
109
Voted
EOR
2007
15 years 4 months ago
2007
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heurist...
191
click to vote
FGR
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper presents a novel framework for recognition of facial action unit (AU) combinations by viewing the classification as a sparse representation problem. Based on this framew...
122
Voted
CPAIOR
2006
Springer
15 years 8 months ago
2006
Springer
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...