Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
In this paper, a primary (licensed) user leases part of its resources to independent secondary (unlicensed) terminals in exchange for a tariff in dollars per bit, under the constra...
Rocco Di Taranto, Petar Popovski, Osvaldo Simeone,...
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...