15375 search results - page 2972 / 3075 » cans 2008 |
173
click to vote
FGR
2008
IEEE
16 years 25 days ago
2008
IEEE
A typical automatic face recognition system is composed of three parts: face detection, face alignment and face recognition. Conventionally, these three parts are processed in a b...
165
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
168
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
197
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
195
click to vote
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...