5606 search results - page 211 / 1122 » Randomization Techniques for Graphs. |
108
Voted
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
A deductive technique is presented that uses voltage testing for the diagnosis of single bridging faults between two gate input or output lines and is applicable to combinational ...
114
Voted
CRYPTO
2007
Springer
15 years 7 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
123
Voted
BMCBI
2010
15 years 27 days ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
209
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
143
Voted
SC
1993
ACM
15 years 4 months ago
1993
ACM
In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations e ectively. The rst mechanism invokes a user speci ed mapping procedure via a s...