Most algorithms for learning and pattern discovery in data assume that all the needed data is available on one computer at a single site. This assumption does not hold in situations where a number of independent databases reside on different nodes of a network. These databases cannot be moved to a common shared site due to size, security, privacy, legal, and data-ownership concerns but all of t...

Operating System designers currently face two major challenges. One is the coexistence of time-sharing and dynamic real-time components on a single machine and even in the same application. The other is that many acceleration techniques (e.g. caches) used in modern hardware architectures work very well for the average case, but not for the worst case which counts for real-time systems. This sce...

Collaborative Web Search (CWS) seeks to exploit the high degree of natural query repetition and result selection regularity that is prevalent among communities of searchers. CWS reuses the search experiences of community members, to promote results that have previously been judged relevant for queries. This facilitates a better response to the type of vague queries that are commonplace in Web s...

We propose a general scheme for the cooperation of different constraint solvers. On top of a uniform interface for constraint we stepwise develop reduction systems which describe the behaviour of an overall combined system. The modularity of our definitions of reduction relations at different levels allows the definition of cooperation strategies for the solvers according to the current require...

This chapter considers the problem of data gathering in correlated wireless sensor networks with distributed source coding (DSC), and virtual multiple input and multiple output (MIMO) based cooperative transmission. Using the concepts of super and sub modularity on a lattice, we analytically quantify as how the optimal constellation size, and optimal number of cooperating nodes, vary with respe...