Sciweavers

5889 search results - page 821 / 1178
» Graph Layout Problems
Sort
View
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
15 years 11 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky
CAISE
2006
Springer
15 years 10 months ago
Detecting Changes in Ontologies via DAG Comparison
Abstract. Ontologies are shared conceptualizations of a certain domain. As such domains may change, also changes in the ontologies have to be considered, as otherwise there is no w...
Johann Eder, Karl Wiggisser
COMPGEOM
1995
ACM
15 years 10 months ago
On Conway's Thrackle Conjecture
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
László Lovász, János P...
VECPAR
2000
Springer
15 years 10 months ago
Finite/Discrete Element Analysis of Multi-fracture and Multi-contact Phenomena
A dynamic domain decomposition strategy is proposed for the effective parallel implementation of combined finite/discrete element approaches for problems involving multi-fracture a...
D. R. J. Owen, Y. T. Feng, Jianguo Yu, Djordje Per...
AIML
2008
15 years 8 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto