5606 search results - page 419 / 1122 » Randomization Techniques for Graphs. |
289
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of individual data records have been proposed recently. In this paper, ...
167
click to vote
SPIN
2009
Springer
16 years 1 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
165
click to vote
ACSD
2003
IEEE
16 years 1 days ago
2003
IEEE
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent an...
191
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
138
Voted
IV
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper describes a paradigm for visualising time deflow in a network of objects connected by abstract relationships (a graph) by representing time in the third dimension. We ...