Sciweavers

8259 search results - page 256 / 1652
» On Generalized Feistel Networks
Sort
View
110
Voted
ICPP
2000
IEEE
15 years 5 months ago
Multilayer VLSI Layout for Interconnection Networks
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-l...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Behrooz P...
97
Voted
INFOCOM
1999
IEEE
15 years 5 months ago
User-Friendly Access Control for Public Network Ports
We are facing a growing user demand for ubiquitous Internet access. As a result, network ports and wireless LANs are becoming common in public spaces inside buildings such as loung...
Guido Appenzeller, Mema Roussopoulos, Mary Baker
SPAA
1994
ACM
15 years 4 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
101
Voted
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 4 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
88
Voted
PODC
2010
ACM
15 years 4 months ago
Brief announcement: asynchronous bounded expected delay networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...