142 search results - page 27 / 29 » Proving Termination by Invariance Relations |
SIAMJO
2002
13 years 7 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
OPODIS
2010
13 years 5 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
SIAMCOMP
2011
13 years 2 months ago
2011
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
CPP
2011
12 years 7 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...