Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Syracuse University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 121 - 150 of 532

Full-Text Articles in Computer Sciences

Gridbased Collaboration In Interactive Data Language Applications, Minjun Wang, Geoffrey C. Fox, Marlon Pierce Jan 2005

Gridbased Collaboration In Interactive Data Language Applications, Minjun Wang, Geoffrey C. Fox, Marlon Pierce

Electrical Engineering and Computer Science - All Scholarship

Interactive Data Language (IDL) is an array-oriented data analysis and visualization application, which is widely used in research, commerce, and education. It is meaningful to make user IDL applications collaborative between computers over networks, using a common message broker as the underlying communication system. In order to achieve the global collaboration, we have brought together in the research a Grid-based Collaboration paradigm, a Shared Event model, different implementing structures, methodologies and technologies. We have succeeded in our prototype codes, and we are currently working on a real life IDL application package to make it collaborative. At the same time, we …

Go to article

Support For High Performance Real-Time Collaboration Within The Naradabrokering Substrate, Shrideep Pallickara, Hasan Bulut, Pete Burnap, Geoffrey C. Fox, Ahmet Uyar, David Walker Jan 2005

Support For High Performance Real-Time Collaboration Within The Naradabrokering Substrate, Shrideep Pallickara, Hasan Bulut, Pete Burnap, Geoffrey C. Fox, Ahmet Uyar, David Walker

Electrical Engineering and Computer Science - All Scholarship

The requirements for collaborative services, especially pertaining to order and delivery, are quite different compared to traditional distributed applications. The NaradaBrokering messaging substrate enables scalable, fault-tolerant, distributed interactions between entities, and is based on the publish/subscribe paradigm. The substrate also incorporates support for Grid and Web Service. More recently, we have incorporated services within the substrate which enable us to facilitate richer collaborative interactions. In this paper, we outline our rationale for incorporating these services and how these services interact with each other. We have conducted experiments related to profiling these services, and also on the performance and scaling of …

Go to article

Global Multimedia Collaboration System, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Shrideep Pallickard Jan 2005

Global Multimedia Collaboration System, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Shrideep Pallickard

Electrical Engineering and Computer Science - All Scholarship

In order to build an integrated collaboration system over heterogeneous collaboration technologies, we propose a Global Multimedia Collaboration System (Global-MMCS) based on XGSP A/V Web-Services framework. This system can integrate multiple A/V services, and support various collaboration clients and communities. Now the prototype is being developed and deployed across many universities in USA and China.

Go to article

Lad: Localization Anomaly Detection For Wireless Sensor Networks, Wenliang Du, Lei Fang, Peng Ning Jan 2005

Lad: Localization Anomaly Detection For Wireless Sensor Networks, Wenliang Du, Lei Fang, Peng Ning

Electrical Engineering and Computer Science - All Scholarship

In wireless sensor networks (WSNs), sensors ’ locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery (localization) schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the reference information provided by these beacon nodes. Most of the beacon-based localization schemes assume a benign environment, where all beacon nodes are supposed …

Go to article

A State-Free Data Delivery Protocol For Multihop Wireless Sensor Networks, Dazhi Chen, Jing Deng, Pramod K. Varshney Jan 2005

A State-Free Data Delivery Protocol For Multihop Wireless Sensor Networks, Dazhi Chen, Jing Deng, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

A novel, state-free, and competition-based data delivery protocol, called State-free Implicit Forwarding (SIF), is proposed for multihop wireless sensor networks. The SIF protocol assumes moderate node density and distance-to-sink awareness. The state-free feature of SIF makes it robust to high network dynamics. SIF also combines the tasks of routing and MAC, via cross-layer design, to simplify the complexity of the protocol stack in sensors and to save precious network resources. Simulation results are presented to show that SIF performs better than some previously proposed protocols for data delivery in terms of communication overhead, packet delivery ratio, and average packet delay.

Go to article

Reliability-Centric High-Level Synthesis, S. Tosun, N. Mansouri, E. Arvas, Mahmut Kandemir, Yuan Xie Jan 2005

Reliability-Centric High-Level Synthesis, S. Tosun, N. Mansouri, E. Arvas, Mahmut Kandemir, Yuan Xie

Electrical Engineering and Computer Science - All Scholarship

Importance of addressing soft errors in both safety critical applications and commercial consumer products is increasing, mainly due to ever shrinking geometries, higher-density circuits, and employment of power-saving techniques such as voltage scaling and component shut-down. As a result, it is becoming necessary to treat reliability as a first-class citizen in system design. In particular, reliability decisions taken early in system design can have significant benefits in terms of design quality. Motivated by this observation, this paper presents a reliability-centric high-level synthesis approach that addresses the soft error problem. The proposed approach tries to maximize reliability of the design while …

Go to article

Multi-Objective Mobile Agent Routing In Wireless Sensor Networks, Ramesh Rajagopalan, Chilukuri K. Mohan, Pramod Varshney, Kishan Mehrotra Jan 2005

Multi-Objective Mobile Agent Routing In Wireless Sensor Networks, Ramesh Rajagopalan, Chilukuri K. Mohan, Pramod Varshney, Kishan Mehrotra

Electrical Engineering and Computer Science - All Scholarship

A recent approach for data fusion in wireless sensor networks involves the use of mobile agents that selectively visit the sensors and incrementally fuse the data, thereby eliminating the unnecessary transmission of irrelevant or non-critical data. The order of sensors visited along the route determines the quality of the fused data and the communication cost. We model the mobile agent routing problem as a multi-objective optimization problem, maximizing the total detected signal energy while minimizing the energy consumption and path loss. Simulation results show that this problem can be solved successfully using evolutionary multi-objective algorithms such as EMOCA and NSGA-II. …

Go to article

Scheduling Sleeping Nodes In High Density Cluster-Based Sensor Networks, Jing Deng, Yunghsiang S. Han, Wendi B. Heinzelman, Pramod K. Varshney Jan 2004

Scheduling Sleeping Nodes In High Density Cluster-Based Sensor Networks, Jing Deng, Yunghsiang S. Han, Wendi B. Heinzelman, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

In order to conserve battery power in very dense sensor networks, some sensor nodes may be put into the sleep state while other sensor nodes remain active for the sensing and communication tasks. In this paper, we study the node sleep scheduling problem in the context of clustered sensor networks. We propose and analyze the Linear Distance-based Scheduling (LDS) technique for sleeping in each cluster. The LDS scheme selects a sensor node to sleep with higher probability when it is farther away from the cluster head. We analyze the energy consumption, the sensing coverage property, and the network lifetime of …

Go to article

Design And Implementation Of Audio/Video Collaboration System Based On Publish/Subscribe Event Middleware, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut Jan 2004

Design And Implementation Of Audio/Video Collaboration System Based On Publish/Subscribe Event Middleware, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut

Electrical Engineering and Computer Science - All Scholarship

In this paper we present our A/V collaboration system based on our XGSP collaboration framework and NaradaBrokering messaging middleware. Using publish/subscribe event model, this system can provide videoconferencing services to heterogeneous endpoints such as H.323, SIP and Access Grid. This paper discusses the common a/v collaboration model shared by all kinds of A/V conferencing clients and introduces the details about how to implement such a model based on publish/subscribe event middleware.

Go to article

Context Sensitive Anomaly Monitoring Of Process Control Flow To Detect Mimicry Attacks And Impossible Paths, Haizhi Xu, Wenliang Du, Steve J. Chapin Jan 2004

Context Sensitive Anomaly Monitoring Of Process Control Flow To Detect Mimicry Attacks And Impossible Paths, Haizhi Xu, Wenliang Du, Steve J. Chapin

Electrical Engineering and Computer Science - All Scholarship

Many intrusions amplify rights or circumvent defenses by issuing system calls in ways that the original process did not. Defense against these attacks emphasizes preventing attacking code from being introduced to the system and detecting or preventing execution of the injected code. Another approach, where this paper fits in, is to assume that both injection and execution have occurred, and to detect and prevent the executing code from subverting the target system. We propose a method using waypoints: marks along the normal execution path that a process must follow to successfully access operating system services. Waypoints actively log trustworthy context …

Go to article

Optimum Transmission Range For Wireless Ad Hoc Networks, Jing Deng, Yunghsiang S. Han, Po-Ning Chen, Pramod K. Varshney Jan 2004

Optimum Transmission Range For Wireless Ad Hoc Networks, Jing Deng, Yunghsiang S. Han, Po-Ning Chen, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

The transmission range that achieves the most economical use of energy in wireless ad hoc networks is studied under homogeneous node distribution. By assuming the knowledge of node location, we first proposed a transmission strategy to ensure the progress of data packets toward their final destinations. Then the average packet progress for a transmission range universal for all nodes is derived, which is accordingly used to determine the optimal transmission range that gives the maximum efficiency of energy consumption. Different from some previous work, our analysis does not make the assumption of large nodal density in the wireless ad hoc …

Go to article

Cooperative Game Theory Within Multi-Agent Systems For Systems Scheduling, Derek Messie, Jae C. Oh Jan 2004

Cooperative Game Theory Within Multi-Agent Systems For Systems Scheduling, Derek Messie, Jae C. Oh

Electrical Engineering and Computer Science - All Scholarship

Research concerning organization and coordination within multi-agent systems continues to draw from a variety of architectures and methodologies. The work presented in this paper combines techniques from game theory and multi-agent systems to produce self-organizing, polymorphic, lightweight, embedded agents for systems scheduling within a large-scale real-time systems environment. Results show how this approach is used to experimentally produce optimum real-time scheduling through the emergent behavior of thousands of agents. These results are obtained using a SWARM simulation of systems scheduling within a High Energy Physics experiment consisting of 2500 digital signal processors.

Go to article

Privacy-Preserving Multivariate Statistical Analysis: Linear Regression And Classification, Wenliang Du, Yunghsiang S. Han, Shigang Chen Jan 2004

Privacy-Preserving Multivariate Statistical Analysis: Linear Regression And Classification, Wenliang Du, Yunghsiang S. Han, Shigang Chen

Electrical Engineering and Computer Science - All Scholarship

Analysis technique that has found applications in various areas. In this paper, we study some multivariate statistical analysis methods in Secure 2-party Computation (S2C) framework illustrated by the following scenario: two parties, each having a secret data set, want to conduct the statistical analysis on their joint data, but neither party is willing to disclose its private data to the other party or any third party. The current statistical analysis techniques cannot be used directly to support this kind of computation because they require all parties to send the necessary data to a central place. In this paper, We define …

Go to article

Building Desktop Applications With Web Service In A Message-Based Mvc Paradigm”, To Appear, Xiaohong Qiu Jan 2004

Building Desktop Applications With Web Service In A Message-Based Mvc Paradigm”, To Appear, Xiaohong Qiu

Electrical Engineering and Computer Science - All Scholarship

Over the past decade, classic client side applications with Model-View-Controller (MVC) architecture haven’t changed much but become more complex. In this paper, we present an approach of building desktop applications with Web Services in an explicit message-based MVC paradigm. By integrating with our publish/subscribe messaging middleware, it makes SVG browser (a Microsoft PowerPoint like client application) with Web Service style interfaces universally accessible from different client platforms ─ Windows, Linux, MacOS, PalmOS and other customized ones. Performance data suggests that this scheme of building application around messages is a practical architecture for the next generation Web application client.

Go to article

A Key Management Scheme For Wireless Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Shigang Chen Jan 2004

A Key Management Scheme For Wireless Sensor Networks Using Deployment Knowledge, Wenliang Du, Jing Deng, Yunghsiang S. Han, Shigang Chen

Electrical Engineering and Computer Science - All Scholarship

To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key predistribution scheme and …

Go to article

Uncheatable Grid Computing, Wenliang Du, Jing Jia, Manish Mangal, Mummoorthy Murugesan Jan 2004

Uncheatable Grid Computing, Wenliang Du, Jing Jia, Manish Mangal, Mummoorthy Murugesan

Electrical Engineering and Computer Science - All Scholarship

Grid computing is a type of distributed computing that has shown promising applications in many fields. A great concern in grid computing is the cheating problem described in the following: a participant is given D = {x1,...,xn}, it needs to compute f(x) for all x ∈ D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. In this paper, we propose a novel …

Go to article

Decision Fusion In A Wireless Sensor Network With A Large Number Of Sensors, Ruixin Niu, Michael Moore, Dale Klamer Jan 2004

Decision Fusion In A Wireless Sensor Network With A Large Number Of Sensors, Ruixin Niu, Michael Moore, Dale Klamer

Electrical Engineering and Computer Science - All Scholarship

For a wireless sensor network (WSN) with a large number of sensors, a decision fusion rule using the total number of detections reported by local sensors for hypothesis testing, is proposed and studied. Based on a signal attenuation model where the received signal power decays as the distance from the target increases, the system level detection performance, namely probabilities of detection and false alarms, are derived and calculated. Without the knowledge of local sensors' performances and at low signal to noise ratio (SNR), this fusion rule can still achieve very good system level detection performance if the number of sensors …

Go to article

Design And Implementation Of A Collaboration Web-Services System, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Harun Altay Jan 2004

Design And Implementation Of A Collaboration Web-Services System, Wenjun Wu, Geoffrey C. Fox, Hasan Bulut, Ahmet Uyar, Harun Altay

Electrical Engineering and Computer Science - All Scholarship

Conference control has been studied for years but most researches focus on homogenous collaboration. There is no conference control framework for integration of multiple collaboration systems such as H.323, SIP and AccessGrid. In this paper we present a web-services based scalable conference control framework for such a heterogeneous collaboration system. Based on this framework, we implemented a prototype system to verify and refine our framework. This system can support various conferencing endpoints and communities.

Go to article

Sensor Fusion For Video Surveillance, Lauro Snidaro, Gian Luca Foresti, Ruixin Niu, Pramod K. Varshney Jan 2004

Sensor Fusion For Video Surveillance, Lauro Snidaro, Gian Luca Foresti, Ruixin Niu, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

In this paper, a multisensor data fusion system for object tracking is presented. It is able to track in real-time multiple targets in outdoor environments. The system can take advantage of the redundant information coming from different sensors monitoring the same scene. The measurements (positions of the targets) obtained from the available sources are fused together to obtain a more accurate estimate. Data fusion is performed considering sensor reliability at every time instant. A confidence measure has been employed to weight sensor data in the fusion process. Compared to single camera systems, the adopted approach has produced more accurate and …

Go to article

Making Svg A Web Service In A Message-Based Mvc Architecture, Xiaohong Qiu, Shrideep Pallickara, Ahmet Uyar Jan 2004

Making Svg A Web Service In A Message-Based Mvc Architecture, Xiaohong Qiu, Shrideep Pallickara, Ahmet Uyar

Electrical Engineering and Computer Science - All Scholarship

We reformulate Scalable Vector Graphics browser in a Web Service architecture separating the rendering from the W3C DOM processing of events. We describe this in a message-based Model-View-Controller (M-MVC) architecture and implement it with a powerful publish-subscribe messaging infrastructure. A Web Services oriented architecture with services loosely coupled by the exchange of messages is becoming an increasingly important feature in the deployment of Internet applications. The broad applicability of this approach includes enterprise software, e-Learning, e-Science and e-Business. Our work provides a general framework for integrating Desktop and Web Service applications. We summarize the performance results from detailed tests of …

Go to article

An Efficient Scheme For Aggregation And Presentation Of Network Performance, Gurhan Gunduz, Shrideep Pallickara, Geoffrey C. Fox Jan 2004

An Efficient Scheme For Aggregation And Presentation Of Network Performance, Gurhan Gunduz, Shrideep Pallickara, Geoffrey C. Fox

Electrical Engineering and Computer Science - All Scholarship

The Internet is presently being used to support increasingly complex interaction models as a result of more and more applications, services and frameworks becoming network centric. Efficient utilization of network and networked resources is of paramount importance. Network performance gathering is a precursor to any scheme that seeks to provide adaptive routing capabilities for interactions. In this paper we present a network performance aggregation framework that is extensible and appropriate for distributed messaging systems that span multiple realms, disparate communication protocols and support different applications.

Go to article

A New Backoff Algorithm For The Ieee 802.11 Distributed Coordination Function, Jing Deng, Pramod K. Varshney, Zygmunt J. Haas Jan 2004

A New Backoff Algorithm For The Ieee 802.11 Distributed Coordination Function, Jing Deng, Pramod K. Varshney, Zygmunt J. Haas

Electrical Engineering and Computer Science - All Scholarship

In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW ). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme, as shown in some studies in the literature, suffers from a fairness problem and low throughput under high traffic load. In this paper, we propose a new backoff algorithm, termed the Linear/Multiplicative Increase and Linear Decrease (LMILD) backoff algorithm, for use with the IEEE 802.11 Distributed Coordination Function. …

Go to article

Balancing The Performance Of A Sensor Network Using An Ant System, Rajani Muraleedharan, Lisa Ann Osadciw Jan 2003

Balancing The Performance Of A Sensor Network Using An Ant System, Rajani Muraleedharan, Lisa Ann Osadciw

Electrical Engineering and Computer Science - All Scholarship

In a sensor network consisting of both wired and wireless links, the nodes sense, collect and distribute dynamic information from one sensor to the other. Energy consumption is a key issue in the sensor’s communications since many use battery power, which is limited. The sensors also have limited memory and functionality to support communications. Therefore, there is a need to balance energy usage with obtaining the shortest communication distance. This paper presents a novel approach to selecting message routes using an ant system. Parameters controlling the convergence of the ant system are analyzed in terms of wired and wireless networks.

Go to article

A Transport Framework For Distributed Brokering Systems, Shrideep Pallickara, Geoffrey C. Fox, John Yin, Gurham Gunduz, Hongbin Liu, Ahmet Uyar, Mustafa Varank Jan 2003

A Transport Framework For Distributed Brokering Systems, Shrideep Pallickara, Geoffrey C. Fox, John Yin, Gurham Gunduz, Hongbin Liu, Ahmet Uyar, Mustafa Varank

Electrical Engineering and Computer Science - All Scholarship

Increasingly, services need to interact with a wide spectrum of devices with varying networking capabilities. Services hosted on a messaging infrastructure need to optimally utilize and exploit the conditions that exist within the local networks. The messaging infrastructure must manage the communication between external resources, services and clients to achieve the highest possible system performance and reliability. In this paper we suggest that a transport framework needs to be incorporated into the messaging infrastructure hosting the services. We base our investigations in the context of the NaradaBrokering system.

Go to article

An Intelligent Deployment And Clustering Algorithm For A Distributed Mobile Sensor Network, Nojeong Heo, Pramod K. Varshney Jan 2003

An Intelligent Deployment And Clustering Algorithm For A Distributed Mobile Sensor Network, Nojeong Heo, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

Energy in a wireless sensor network(WSN) is a precious resource. Deployment of mobile sensors in a WSN is an energy consuming process and it should be carefully designed. In this paper, we propose an intelligent energy-efficient deployment algorithm for cluster-based WSN by a synergistic combination of cluster structuring and a peer-to-peer deployment scheme. Performance of our algorithm is evaluated in terms of coverage, uniformity, and time and distance traveled till the algorithm converges. Our algorithm is shown to exhibit excellent performance.

Go to article

Optimization Using Particle Swarms With Near Neighbor Interactions, Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri K. Mohan, Lisa Ann Osadciw Jan 2003

Optimization Using Particle Swarms With Near Neighbor Interactions, Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri K. Mohan, Lisa Ann Osadciw

Electrical Engineering and Computer Science - All Scholarship

This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. In the new algorithm, each particle is attracted towards the best previous positions visited by its neighbors, in addition to the other aspects of particle dynamics in PSO. This is accomplished by using the ratio of the relative fitness and the distance of other particles to determine the direction in which each component of the particle position needs to be changed. The resulting algorithm, known as Fitness-Distance-Ratio based PSO (FDR-PSO), is shown to perform …

Go to article

Defining Open Source Software Project Success, Kevin Crowston, Hala Annabi, James Howison Jan 2003

Defining Open Source Software Project Success, Kevin Crowston, Hala Annabi, James Howison

School of Information Studies - Faculty Scholarship

No abstract provided.

Go to article

Mutual Information Based Image Registration For Remote Sensing Data, Hua-Mei Chen, Manoj K. Arora, Pramod K. Varshney Jan 2003

Mutual Information Based Image Registration For Remote Sensing Data, Hua-Mei Chen, Manoj K. Arora, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

Registration is a fundamental operation in image processing to align images taken at different times, from different sensors or from different viewing angles. Automatic image registration procedures are gaining importance to efficiently register large volumes of remote sensing data available these days. In this Letter, we investigate an automated mutual information based registration technique for remote sensing data. Performance of a number of interpolation algorithms to compute mutual information for registration of multi-sensor and multi-resolution Landsat TM, Radarsat SAR and IRS PAN images is evaluated.

Go to article

Peer-To-Peer Grids, Geoffrey C. Fox, Dennis Gannon, Sung-Hoon Ko, Shrideep Pallickara, Xiaohong Qiu, Ahmet Uyar Jan 2003

Peer-To-Peer Grids, Geoffrey C. Fox, Dennis Gannon, Sung-Hoon Ko, Shrideep Pallickara, Xiaohong Qiu, Ahmet Uyar

Electrical Engineering and Computer Science - All Scholarship

We describe Peer-to-Peer Grids built around Integration of technologies from the peer-to-peer and Grid fields. We focus on the role of Web services linked by a powerful event service using uniform XML interfaces and application level routing. We describe how a rich synchronous and asynchronous collaboration environment can support virtual communities built on top of such infrastructure. Universal access mechanisms are discussed.

Go to article

Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques, Huseyin Polat, Wenliang Du Jan 2003

Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques, Huseyin Polat, Wenliang Du

Electrical Engineering and Computer Science - All Scholarship

Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. E-commerce sites use CF systems to suggest products to customers based on like-minded customers' preferences. People use CF systems to cope with information overload. To conduct collaborative filtering, data from customers are needed. However, collecting high quality data from customers is not an easy task because many customers are so concerned about their privacy that they might decide to give false information. CF systems using these data might produce inaccurate recommendations. We propose a randomized perturbation technique to protect users' privacy while still producing accurate recommendations. …

Go to article

First Prev Next Last