406 search results - page 28 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
112
click to vote
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
102
click to vote
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
113
click to vote
COLT
2003
Springer
15 years 5 months ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...
105
click to vote
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
One promising approach to remove motion deblurring is to recover one clear image using an image pair. Existing dual-image methods require an accurate image alignment between the i...
ECCC
2008
14 years 11 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...