Sciweavers

4451 search results - page 89 / 891
» On Random Ordering Constraints
Sort
View
BIRTHDAY
2010
Springer
15 years 3 months ago
Specifying and Verifying Organizational Security Properties in First-Order Logic
In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell–La Padula. We show t...
Christoph Brandt, Jens Otten, Christoph Kreitz, Wo...
ACL
2009
15 years 1 months ago
Topological Ordering of Function Words in Hierarchical Phrase-based Translation
Hierarchical phrase-based models are attractive because they provide a consistent framework within which to characterize both local and long-distance reorderings, but they also ma...
Hendra Setiawan, Min-Yen Kan, Haizhou Li, Philip R...
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 11 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
ICALP
1998
Springer
15 years 8 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
15 years 9 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira