259 search results - page 8 / 52 » Graph Distances in the Data-Stream Model |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
ESA
2010
Springer
13 years 9 months ago
2010
Springer
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
CIAC
2006
Springer
14 years 1 days ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
People’s email communications can be modeled as graphs with vertices representing email accounts and edges representing email communications. Email communication data usually co...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...