Sciweavers

730 search results - page 56 / 146
» Combinatorics of Monotone Computations
Sort
View
CPM
2004
Springer
138views Combinatorics» more  CPM 2004»
14 years 2 months ago
Reversal Distance without Hurdles and Fortresses
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
Anne Bergeron, Julia Mixtacki, Jens Stoye
MOR
2010
108views more  MOR 2010»
13 years 7 months ago
Accuracy Certificates for Computational Problems with Convex Structure
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
TIP
2010
119views more  TIP 2010»
13 years 3 months ago
Software Designs of Image Processing Tasks With Incremental Refinement of Computation
Software realizations of computationally-demanding image processing tasks (e.g. image transforms and convolution) do not currently provide graceful degradation when their clock-cy...
Davide Anastasia, Yiannis Andreopoulos
EOR
2007
102views more  EOR 2007»
13 years 9 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 11 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák