Sciweavers

2452 search results - page 360 / 491
» The Case for Precision Sharing
Sort
View
IJHPCN
2006
106views more  IJHPCN 2006»
15 years 6 months ago
Performance evaluation of the Sun Fire Link SMP clusters
As symmetric multiprocessors become commonplace, the interconnection networks and the communication system software in clusters of multiprocessors become critical to achieving high...
Ying Qian, Ahmad Afsahi, Nathan R. Fredrickson, Re...
JOC
2007
133views more  JOC 2007»
15 years 6 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin
CMOT
2004
141views more  CMOT 2004»
15 years 6 months ago
Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
Garry Robins, Malcolm Alexander
MISQ
2000
104views more  MISQ 2000»
15 years 6 months ago
Understanding Computer-Mediated Discussions: Positivist and Interpretive Analyses of Group Support System Use
This research considers whether interpretive techniques can be used to enhance our understanding of computer-mediated discussions. The case study considered in this research is th...
Eileen M. Trauth, Leonard M. Jessup
CC
1998
Springer
111views System Software» more  CC 1998»
15 years 6 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson