7913 search results - page 433 / 1583 » Information Collection on a Graph |
134
click to vote
ASIACRYPT
2005
Springer
15 years 10 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...
150
click to vote
DAWAK
2005
Springer
15 years 10 months ago
2005
Springer
Extract-Transform-Load (ETL) workflows are data centric workflows responsible for transferring, cleaning, and loading data from their respective sources to the warehouse. Previous ...
153
click to vote
EUROPAR
2005
Springer
15 years 10 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
123
click to vote
SEMWEB
2005
Springer
15 years 10 months ago
2005
Springer
The integration of heterogenous data sources is a crucial step for the upcoming semantic web – if existing information is not integrated, where will the data come from that the s...
129
click to vote
IV
2002
IEEE
15 years 9 months ago
2002
IEEE
We apply fillets — smoothing of sharp angles at the joints — between the connections and nodes of graph-like diagrams. In situations where the graph layout is constrained, e....