Sciweavers

VLDB
2004
ACM
96views Database» more  VLDB 2004»
13 years 10 months ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui
EUROCRYPT
2004
Springer
13 years 10 months ago
Secure Computation of the k th-Ranked Element
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...
Gagan Aggarwal, Nina Mishra, Benny Pinkas
SPAA
2004
ACM
13 years 11 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
HIPC
2007
Springer
13 years 11 months ago
P2P Document Tree Management in a Real-Time Collaborative Editing System
This paper presents our work in combining peer-to-peer dynamic tree management with hierarchical Operational Transformation (OT) over document trees to achieve low computational an...
Jon A. Preston, Sushil K. Prasad
CDC
2008
IEEE
142views Control Systems» more  CDC 2008»
13 years 12 months ago
Asynchronous distributed optimization with minimal communication
— We consider problems where multiple agents must cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchange...
Minyi Zhong, Christos G. Cassandras