Sciweavers

340 search results - page 28 / 68
» ets 2009
Sort
View
GD
2009
Springer
15 years 10 months ago
Port Constraints in Hierarchical Layout of Data Flow Diagrams
Abstract. We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practi...
Miro Spönemann, Hauke Fuhrmann, Reinhard von ...
GD
2009
Springer
15 years 10 months ago
On the Characterization of Level Planar Trees by Minimal Patterns
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns....
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
STACS
2009
Springer
15 years 10 months ago
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Andre Gronemeier
AAECC
2009
Springer
138views Algorithms» more  AAECC 2009»
15 years 9 months ago
Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE
Abstract. We build on the new security notion for deterministic encryption (PRIV) and the PRIV-secure schemes presented by Bellare et al at Crypto'07. Our work introduces: 1) ...
Yang Cui, Kirill Morozov, Kazukuni Kobara, Hideki ...
CDC
2009
IEEE
15 years 9 months ago
On the queue-overflow probabilities of distributed scheduling algorithms
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...
Can Zhao, Xiaojun Lin