3818 search results - page 275 / 764 » Word Problems on Compressed Words |
145
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
209
click to vote
TCS
2010
15 years 1 months ago
2010
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
206
click to vote
SIAMJO
2011
15 years 1 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
180
click to vote
SIAMCO
2011
14 years 9 months ago
2011
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical di...
185
click to vote
EMNLP
2011
14 years 6 months ago
2011
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...