Sciweavers

2477 search results - page 148 / 496
» Approximate extended formulations
Sort
View
JAIR
2008
136views more  JAIR 2008»
15 years 4 months ago
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
James Clarke, Mirella Lapata
NETWORKS
2008
15 years 4 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
IPL
2007
107views more  IPL 2007»
15 years 4 months ago
Flows in dynamic networks with aggregate arc capacities
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
Vardges Melkonian
ENTCS
2000
81views more  ENTCS 2000»
15 years 4 months ago
Secrecy, Group Creation
We lift Cardelli, Ghelli and Gordon's secrecy group creation operator [1] to a relative of the spicalculus that supports symmetric key cryptography, and show a natural extens...
Luca Cardelli, Andy Gordon, Giorgio Ghelli
AAECC
1998
Springer
167views Algorithms» more  AAECC 1998»
15 years 4 months ago
Generalized Bezout Identity
We describe a new approach of the generalized Bezout identity for linear time-varying ordinary differential control systems. We also explain when and how it can be extended to line...
J. F. Pommaret, Alban Quadrat