5606 search results - page 467 / 1122 » Randomization Techniques for Graphs. |
175
Voted
ICMCS
2006
IEEE
16 years 25 days ago
2006
IEEE
A lightweight encryption technique for JPEG2000 with optional support for transparent encryption is proposed. Randomized anisotropic wavelet packet bases are used to construct a s...
161
click to vote
EPEW
2006
Springer
15 years 10 months ago
2006
Springer
We propose new techniques to simplify the computation of the cycle times and the absorption times for a large class of PEPA models. These techniques allow us to simplify the model ...
145
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems...
191
click to vote
MVA
2007
15 years 6 months ago
2007
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
191
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...