Sciweavers

Share
ICMCS
2010
IEEE
146views Multimedia» more  ICMCS 2010»
9 years 7 months ago
Privacy-preserving approximation of L1 distance for multimedia applications
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
Shantanu Rane, Wei Sun, Anthony Vetro
USENIX
1994
9 years 7 months ago
TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems
TreadMarks is a distributed shared memory DSM system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultr...
Peter J. Keleher, Alan L. Cox, Sandhya Dwarkadas, ...
CASCON
1996
99views Education» more  CASCON 1996»
9 years 7 months ago
Modeling and analysis of the Unix communication subsystems
The performance of host communication subsystems is an important research topic in computer networks.1 Performance metrics such as throughput, delay, and packet loss are important...
Yi-Chun Chu, Toby J. Teorey
EUROCRYPT
2004
Springer
9 years 9 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
DAC
2004
ACM
9 years 9 months ago
Communication-efficient hardware acceleration for fast functional simulation
This paper presents new technology that accelerates system verification. Traditional methods for verifying functional designs are based on logic simulation, which becomes more tim...
Young-Il Kim, Woo-Seung Yang, Young-Su Kwon, Chong...
AICCSA
2007
IEEE
99views Hardware» more  AICCSA 2007»
9 years 10 months ago
An Efficient Processor Allocation Strategy that Maintains a High Degree of Contiguity among Processors in 2D Mesh Connected Mult
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In noncontiguous allocation, a ...
Saad Bani-Mohammad, Mohamed Ould-Khaoua, Ismail Ab...
HPCN
1997
Springer
9 years 10 months ago
Parallel Simulation of Ion Recombination in Nonpolar Liquids
Abstract. Ion recombination in nonpolar liquids is an important problem in radiation chemistry. We have designed and implemented a parallel Monte Carlo simulation for this computat...
Frank J. Seinstra, Henri E. Bal, Hans J. W. Spoeld...
CODES
1999
IEEE
9 years 10 months ago
Optimizing geographically distributed timed cosimulation by hierarchically grouped messages
raction levels of communication models to allow designers to trade off between performance and accuracy. Contrary to [2][3], we present an optimization method which preserves the a...
Sungjoo Yoo, Kiyoung Choi
INFOCOM
2002
IEEE
9 years 10 months ago
Clustering Overhead for Hierarchical Routing in Mobile Ad hoc Networks
Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the comm...
John Sucec, Ivan Marsic
ICDM
2003
IEEE
140views Data Mining» more  ICDM 2003»
9 years 11 months ago
Mining Frequent Itemsets in Distributed and Dynamic Databases
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
Matthew Eric Otey, Chao Wang, Srinivasan Parthasar...
books