Sciweavers

1172 search results - page 90 / 235
» Constructions of generalized Sidon sets
Sort
View
KBSE
2007
IEEE
16 years 19 days ago
Ensuring consistency in long running transactions
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
Jeffrey Fischer, Rupak Majumdar
CCCG
2001
15 years 7 months ago
Tight degree bounds for pseudo-triangulations of points
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
Lutz Kettner, David G. Kirkpatrick, Bettina Speckm...
CORR
2006
Springer
103views Education» more  CORR 2006»
15 years 6 months ago
Expressing Security Properties Using Selective Interleaving Functions
McLean's notion of Selective Interleaving Functions (SIFs) is perhaps the bestknown attempt to construct a framework for expressing various security properties. We examine th...
Joseph Y. Halpern, Sabina Petride
AAAI
2007
15 years 8 months ago
Computing Optimal Subsets
Various tasks in decision making and decision support require selecting a preferred subset of items from a given set of feasible items. Recent work in this area considered methods...
Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shi...
ENTCS
2010
90views more  ENTCS 2010»
15 years 6 months ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...