1433 search results - page 65 / 287 » On Covering Problems of Rado |
117
click to vote
CVPR
2010
IEEE
15 years 1 months ago
2010
IEEE
The primary and novel contribution of this work is the conjecture that large collections of georeferenced photo collections can be used to derive maps of what-is-where on the surf...
137
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
STOC
1993
ACM
15 years 4 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We propose a multi-document generic summarization model based on the budgeted median problem. Our model selects sentences to generate a summary so that every sentence in the docum...