Sciweavers

5448 search results - page 1056 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
PAISI
2010
Springer
14 years 10 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
ANCS
2009
ACM
14 years 10 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...
ICCAD
2009
IEEE
179views Hardware» more  ICCAD 2009»
14 years 10 months ago
Automatic memory partitioning and scheduling for throughput and power optimization
Hardware acceleration is crucial in modern embedded system design to meet the explosive demands on performance and cost. Selected computation kernels for acceleration are usually ...
Jason Cong, Wei Jiang, Bin Liu, Yi Zou
ICCAD
2009
IEEE
125views Hardware» more  ICCAD 2009»
14 years 10 months ago
CROP: Fast and effective congestion refinement of placement
Modern circuits become harder to route with the ever decreasing design features. Previous routability-driven placement techniques are usually tightly coupled with the underlying p...
Yanheng Zhang, Chris Chu
IEPOL
2010
130views more  IEPOL 2010»
14 years 9 months ago
Piracy or promotion? The impact of broadband Internet penetration on DVD sales
ABSTRACT Digital computer networks represent a disruptive technology, with the potential to create or destroy economic value in established industries. These opportunities and chal...
Michael D. Smith, Rahul Telang
« Prev « First page 1056 / 1090 Last » Next »