Sciweavers

9405 search results - page 167 / 1881
» Computing a Model of Set Theory
Sort
View
PDCAT
2007
Springer
15 years 9 months ago
Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...
Yingpeng Sang, Hong Shen
104
Voted
CIE
2007
Springer
15 years 9 months ago
The Complexity of Quickly ORM-Decidable Sets
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
Joel David Hamkins, David Linetsky, Russell G. Mil...
HIS
2004
15 years 4 months ago
A Case-Based Recommender for Task Assignment in Heterogeneous Computing Systems
Case-based reasoning (CBR) is a knowledge-based problem-solving technique, which is based on reuse of previous experiences. In this paper we propose a new model for static task as...
S. Ghanbari, Mohammad Reza Meybodi, Kambiz Badie
ECIS
2004
15 years 4 months ago
Seeking legitimation for an information system: a preliminary process model
This research throws light on to the role of social issues in developing a successful information system. In a case study of a community health organization, we describe how IT ma...
Donal J. Flynn, Zahid Hussain
127
Voted
DCOSS
2009
Springer
15 years 8 months ago
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
Kamrul Islam, Selim G. Akl, Henk Meijer