Sciweavers

35 search results - page 4 / 7
» TS2-tree - an efficient similarity based organization for tr...
Sort
View
PAISI
2010
Springer
13 years 5 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...
GRID
2005
Springer
14 years 18 days ago
Protecting grid data transfer services with active network interfaces
A key goal of grid computing is to provide seamless access to shared computational and data resources across organizational boundaries, in distributed virtual organizations. Grid ...
Onur Demir, Michael R. Head, Kanad Ghose, Madhusud...
BROADNETS
2004
IEEE
13 years 11 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
EDBT
2004
ACM
172views Database» more  EDBT 2004»
14 years 7 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
EDBT
2009
ACM
132views Database» more  EDBT 2009»
14 years 1 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou