Sciweavers

567 search results - page 34 / 114
» Decomposing replicable functions
Sort
View
77
Voted
IPPS
2005
IEEE
15 years 3 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...
ICPR
2008
IEEE
15 years 11 months ago
An adaptive-PCA algorithm for reflectance estimation from color images
This paper deals with the problem of spectral reflectance estimation from color camera outputs. Because the reconstruction of such functions is an inverse problem, stabilizing the...
Alamin Mansouri, Jon Yngve Hardeberg, Tadeusz Sliw...
ICIP
2009
IEEE
15 years 10 months ago
Quantifying Color Image Distortions Based On Adaptive Spatio-chromatic Signal Decompositions
We describe a framework for quantifying color image distortion based on an adaptive signal decomposition. Specifically, local blocks of the image error are decomposed using a set ...
ICDCSW
2008
IEEE
15 years 4 months ago
Manetkit: A Framework for MANET Routing Protocols
Research in MANETs has resulted in the development of numerous and diverse routing protocols. We argue in this paper that this diversity is inherent to the MANET domain and theref...
Rajiv Ramdhany, Geoff Coulson
DAC
1995
ACM
15 years 1 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen