1566 search results - page 40 / 314 » On a Cone Covering Problem |
134
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
167
click to vote
AMFG
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a general framework for face modeling under varying lighting conditions. First, we show that a face lighting subspace can be constructed based on three o...
191
click to vote
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
131
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
199
click to vote
ISAAC
2000
Springer
15 years 9 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...