1671 search results - page 103 / 335 » On the Covering Steiner Problem |
126
Voted
CVPR
2010
IEEE
15 years 2 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...
99
Voted
CORR
2010
Springer
15 years 27 days 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...
97
Voted
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...
100
Voted
CIKM
2009
Springer
15 years 7 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...
136
Voted
PODS
2003
ACM
16 years 28 days ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...