in a collaborative, yet parti-tioned manner, and results are iteratively refined and returned to the querier. Analytical and experimental evaluations convey the scalability of P3Q for top-k query processing. More specifically, we show that on a 10,000-user delicious trace, with little storage at each

also compare our approach to pro-cessor partitioning alone and a state-of-the-art cache parti-tioning scheme and our scheme fares 8.21 % and 9.19 % better than these schemes on a 16 core system. 1.

We present a formal framework of an autonomous agent as a collection of coordinated control loops, with a recurring sense, plan, act cycle. Our framework manages the informa-tion flow within the partitioned structure to ensure consis-tency in order to direct the flow of goals and observations in a

Synthetic biology has significantly advanced the design of synthetic control devices, gene circuits and networks that can reprogram mammalian cells in a trigger-inducible manner. Prokaryotic helix-turn-helix motifs have become the standard resource to design synthetic mammalian transcrip-tion

are partitioned before any query arrives. However, objects closer to a query may be partitioned into different buckets, which is undesirable. Due to the use of query-oblivious bucket parti-tion, the state-of-the-art LSH schemes for external memory, namely C2LSH and LSB-Forest, only work with approxima-tion ratio

Abstract. Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evalua-tion (SFE) protocols. However, interaction is a primary feature of any OT protocol. In this paper, we show how to remove the interaction require-ment in an OT

Summary. In this chapter, we examine the problem of Web community identifica-tion expressed in terms of the graph or network structure induced by the Web. While the task of community identification is obviously related to the more fundamental problems of graph partitioning and clustering, the basic

aspe ts, among wh h fault-toleran e. In thcW paper we dis uss hs to apply refle tion to multi-layer systems for implementing faulttoleran e in an independent and prin ipled manner. We analyze thl onne tions between thw underlying assumptions of fault-toleran e strategies and different layers of a

Web service technologies promise to facilitate collabora-tion among business partners by helping potential business partners find one another and integrate their business pro-cesses to do business. Daunting challenges however exist before the full potential of Web services can be realized. In

auxiliary information. In particular, if the auxiliary information contains only partial, “noisy, ” or computa-tionally invertible information on secret inputs, then only such informa-tion should be revealed. We construct a universally composable AAI two-party and multiparty computation protocol