1671 search results - page 231 / 335 » On the Covering Steiner Problem |
161
Voted
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
A fundamental challenge in face recognition lies in determining what facial features are important for the identification of faces. In this paper, a novel face recognition framewo...
184
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
250
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
180
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
171
click to vote
STACS
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...