Sciweavers

7758 search results - page 59 / 1552
» On the Number of Distributive Lattices
Sort
View
ICIP
2005
IEEE
14 years 2 months ago
Minmax strategies for QIM watermarking subject to attacks with memory
This paper examines the role of attacker’s memory in Quantization Index Modulation (QIM) watermarking systems. First we derive the attacker’s noise distribution that maximizes...
Pierre Moulin, Anil Kumar Goteti
OPODIS
2008
13 years 10 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
ICS
1998
Tsinghua U.
14 years 28 days ago
Techniques for Empirical Testing of Parallel Random Number Generators
Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such ...
Paul D. Coddington, Sung Hoon Ko
IPPS
2007
IEEE
14 years 3 months ago
Tera-scalable Fourier Spectral Element Code for DNS of Channel Turbulent Flow at High Reynolds Number
Due to the extensive requirement of memory and speed for direct numerical simulation (DNS) of channel turbulence, people can only perform DNS at moderate Reynolds number before. W...
Jin Xu
CIAC
2010
Springer
252views Algorithms» more  CIAC 2010»
14 years 1 months ago
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira