2693 search results - page 264 / 539 » On Computing Complex Navigation Functions |
218
click to vote
TRIDENTCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Deploying and controlling experiments running on a distributed set of resources is a challenging task. Software developers often spend a significant amount of time dealing with the...
140
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, based on a careful investigation on the calibration (downsample) technique, we improve two detectors for detecting LSB matching: Calibrated HCF COM and Calibrated A...
168
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
174
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
139
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper a new class of invertible watermarking approach based on quantization has been introduced. Based on the necessary conditions (blindness, reversibility and impercepti...