Sciweavers

769 search results - page 93 / 154
» Where Is the Proof
Sort
View
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 8 months ago
Generalized Bundle Methods
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...
Antonio Frangioni
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 8 months ago
Simultaneous communication in noisy channels
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
Amit Weinstein
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 4 months ago
Polarized Montagovian Semantics for the Lambek-Grishin calculus
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
Arno Bastenhof
POPL
2011
ACM
12 years 11 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
IACR
2011
104views more  IACR 2011»
12 years 8 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia