Sciweavers

729 search results - page 51 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 9 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
CC
2006
Springer
147views System Software» more  CC 2006»
13 years 7 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
DMS
2010
189views Multimedia» more  DMS 2010»
13 years 5 months ago
Visualizing the Commonalities Between Hierarchically Structured Data Queries
Abstract--In this paper we present an information visualization approach for visualizing the intersection between multiple feature hierarchies. In cases where a dataset has multipl...
Chad Jones, Ryan Armstrong, Kwan-Liu Ma
ISCC
2009
IEEE
163views Communications» more  ISCC 2009»
14 years 2 months ago
Distributed parallel scheduling algorithms for high-speed virtual output queuing switches
Abstract—This paper presents a novel scalable switching architecture for input queued switches with its proper arbitration algorithms. In contrast to traditional switching archit...
Lotfi Mhamdi, Mounir Hamdi
ASIACRYPT
2004
Springer
14 years 1 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan