262,286 Hits in 5.6 sec

Preserving Randomness for Adaptive Algorithms [article]

William M. Hoza, Adam R. Klivans
2018 arXiv   pre-print
Our algorithm combines a variant of the INW pseudorandom generator (STOC '94) with a new scheme for shifting and rounding the outputs of Est.  ...  Suppose Est is a randomized estimation algorithm that uses n random bits and outputs values in R^d.  ...  Acknowledgments We thank David Zuckerman for observations about block decision trees.  ... 
arXiv:1611.00783v5 fatcat:vkwz4qr4s5dbli5hkcok2nluy4

Adaptive Random Decision Tree: A New Approach for Data Mining with Privacy Preserving

Hemlata B. Deorukhakar, Prof. Pradnya Kasture
2015 International Journal of Innovative Research in Computer and Communication Engineering  
In this paper, to deal with distributed data in privacy preserving data mining technology using classification approach of Adaptive Random Decision Tree.  ...  Now a day's fastest growing field data mining with privacy preserving is essential for fast development of high dimensional data and to manage that data efficiently while preserving privacy.  ...  The Dissertation is based on research work in A Random Decision Tree Framework for Privacy-Preserving Data Mining by G.  ... 
doi:10.15680/ijircce.2015.0307004 fatcat:bbhvvop36ferzpw3dhrmzv4kca

A Feasibility-Preserving Crossover and Mutation Operator for Constrained Combinatorial Problems [chapter]

Martin Lukasiewycz, Michael Glaß, Jürgen Teich
2008 Lecture Notes in Computer Science  
This paper presents a feasibility-preserving crossover and mutation operator for evolutionary algorithms for constrained combinatorial problems.  ...  Hence, this allows the evolutionary algorithm to focus on the optimization of the objectives instead of searching for feasible solutions.  ...  Minimizing the Adaption Diversity To preserve the information within the feasibility-preserving operator, the adaption diversity has to be minimized.  ... 
doi:10.1007/978-3-540-87700-4_91 fatcat:zhsh5ny4azg77o4yvw5gykhbeq

Hamiltonian Monte Carlo with explicit, reversible, and volume-preserving adaptive step size control

Michiko Okudo, Hideyuki Suzuki
2017 JSIAM Letters  
We propose a new explicit, reversible, and volume-preserving integration method to adaptively set the step sizes, which does not violate the detailed balance condition or require a large increase in computational  ...  We present a Hamiltonian Monte Carlo method with adaptive step size control to further enhance the efficiency.  ...  Acknowledgments The authors are grateful to Takayasu Matsuo and Shun Sato for valuable comments.  ... 
doi:10.14495/jsiaml.9.33 fatcat:lmdn3sgf6zaktfm6rsipr7m3iy

Identification of robust adaptation gene regulatory network parameters using an improved particle swarm optimization algorithm

X.N. Huang, H.P. Ren
2016 Genetics and Molecular Research  
The particle crossover operation and elitist preservation strategy are also used in the proposed algorithm. The 2 X.N. Huang and H.P.  ...  The proposed methodology, owing to its universality and simplicity, is useful for providing the guidance to design GRN with superior robust adaptation.  ...  For the three-node NFBLB type GRN model, there are 12 parameters to be determined to demonstrate its robust adaptation.  ... 
doi:10.4238/gmr.15028652 pmid:27323043 fatcat:p74cjkn3qzbonpf6lwyi5yk3ee

Salt-and-pepper noise removal by median-type noise detectors and detail-preserving regularization

R.H. Chan, Chung-Wa, M. Nikolova
2005 IEEE Transactions on Image Processing  
This paper proposes a two-phase scheme for removing salt-and-pepper impulse noise.  ...  In the first phase, an adaptive median filter is used to identify pixels which are likely to be contaminated by noise (noise candidates).  ...  ADAPTIVE MEDIAN FILTER AND EDGE-PRESERVING REGULARIZATION B.  ... 
doi:10.1109/tip.2005.852196 pmid:16238054 fatcat:ulvwh4shpnfutemmi4gcuzvx54


Yushan Liu, Shouling Ji, Prateek Mittal
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
Currently, the design of such social security mechanisms is limited to the classical paradigm of using fixed-length random walks for all nodes on a social graph.  ...  preserving systems, and show up to two orders of magnitude improvement in performance.  ...  Using real-world social network topologies, we show that both the node-adaptive and path-adaptive algorithms significantly outperform the existing fixed length algorithms for any given expected random  ... 
doi:10.1145/2976749.2978319 dblp:conf/ccs/LiuJM16 fatcat:gumslqzrxzalpgq7mfp4cadbju

A novel denoising algorithm for medical images based on the non‐convex non‐local similar adaptive regularization

Lin Tian, Jiaqing Miao, Xiaobing Zhou, Chao Wang
2021 IET Image Processing  
For a given patch, a non-convex non-local similarity adaptive method is adopted for sparse representation of images.  ...  In order to make better use of the sparse regularization method for image denoising, the parameters used in this study are estimated using adaptive methods.  ...  For the present new algorithm, the denoised image has a good visualization, and suppression of details is not visible, and boundaries of objects in the image are well preserved.  ... 
doi:10.1049/ipr2.12138 fatcat:7vwnvsmy6vdazoowllty76uns4

Spatio-Temporal Tensor Sketching via Adaptive Sampling [article]

Jing Ma, Qiuchen Zhang, Joyce C. Ho, Li Xiong
2020 arXiv   pre-print
In this paper, we propose SkeTenSmooth, a novel tensor factorization framework that uses adaptive sampling to compress the tensor in a temporally streaming fashion and preserves the underlying global structure  ...  Experiments on the New York City Yellow Taxi data show that SkeTenSmooth greatly reduces the memory cost and outperforms random sampling and fixed rate sampling method in terms of retaining the underlying  ...  We compare our proposed random projection algorithm for the ARIMA coefficients with the k-means algorithm where similar time series can also be clustered and thereby reducing training time.  ... 
arXiv:2006.11943v1 fatcat:eqbzhc4gznejvp2vfhiyycgguq

Adaptive Random Network Coding in WiMAX

J. Jin, B. Li
2008 2008 IEEE International Conference on Communications  
In this paper, we propose adaptive random network coding in WiMAX by introducing two algorithms in order to further improve the performance.  ...  Coupled with random network coding, both algorithms offer salient performance improvement as evidenced in our simulation evaluation.  ...  The simulation result shows that the average preserved bandwidth on the adaptive upstream Preserved bandwidth by MRNC: the adaptive upstream node algorithm over the regular MRNC in the WiMAX handover scenario  ... 
doi:10.1109/icc.2008.488 dblp:conf/icc/JinL08 fatcat:4vcsvjdgrvehte5emflfdjmtxq

Optimizing flow sampling for network anomaly detection

Karel Bartos, Martin Rehak, Vojtech Krmicek
2011 2011 7th International Wireless Communications and Mobile Computing Conference  
Specifically, we propose an adaptive, feature-aware statistical sampling technique and compare it both formally and empirically with other known sampling techniques -random flow sampling and selective  ...  Some moments, especially those related to the primary features, are even more reversible than corresponding moments of random sampling, which makes the adaptive sampling a promising approach for preserving  ...  E, Random L, Selective L and Adaptive L.  ... 
doi:10.1109/iwcmc.2011.5982728 dblp:conf/iwcmc/BartosRK11 fatcat:ahgfak7dirc5hghx34ydaodqza


Fahmy Aly, Fakhry Medhat, M. Hanafy, EI-Zeweidy Aly
2011 International Conference on Aerospace Sciences and Aviation Technology  
One approach for this problem is to randomize the values in individual records, and only disclose the randomized values.  ...  In this paper, a novel privacy preserving data mining algorithm based on the use of Artificial Neural Network (ANN) is introduced.  ...  The information loss is utilized for each algorithm as a metric to study the performance of the privacy preserving data mining algorithms.  ... 
doi:10.21608/asat.2011.27210 fatcat:cxe3igqlkrbfrgujsuaveytnoe

Minimization of detail-preserving regularization functional by Newton's method with continuation

R.H. Chan, Chung-Wa Ho, Chun-Yee Leung, M. Nikolova
2005 IEEE International Conference on Image Processing 2005  
In the first phase, an adaptive median filter is used to identify pixels which are likely to be contaminated by noise (noise candidates).  ...  The speed of our method can be double as that of the method proposed in [14] for images contaminated by 30% salt-and-pepper noise and will be faster for higher noise level.  ...  Tables I and II show the time required for the whole denoising process for the adaptive median filter, the algorithm proposed in [14] and our algorithm on the images contaminated by salt-and-pepper  ... 
doi:10.1109/icip.2005.1529703 dblp:conf/icip/ChanHLN05 fatcat:u5aod2xoe5gsdbq2butjegpapy

Random walks for feature-preserving mesh denoising

Xianfang Sun, Paul L. Rosin, Ralph R. Martin, Frank C. Langbein
2008 Computer Aided Geometric Design  
The vertex position updating procedure uses the conjugate gradient algorithm for speed of convergence.  ...  adjusted to enhance the feature-preserving property of the algorithm.  ...  Although our algorithm is simple and efficient for feature-preserving mesh denoising, it is not immune to certain problems that other algorithms also meet.  ... 
doi:10.1016/j.cagd.2007.12.008 fatcat:5avh64momfcfrol7bvad4cxggu

Random walks for mesh denoising

Xianfang Sun, Paul L. Rosin, Ralph R. Martin, Frank C. Langbein
2007 Proceedings of the 2007 ACM symposium on Solid and physical modeling - SPM '07  
The vertex position updating procedure uses the conjugate gradient algorithm for speed of convergence.  ...  adjusted to enhance the feature-preserving property of the algorithm.  ...  A basic requirement for a mesh denoising algorithm is that it can both remove noise and preserve mesh features effectively.  ... 
doi:10.1145/1236246.1236252 dblp:conf/sma/SunRML07 fatcat:hbap564nivay5cozqbpydzlkhi
« Previous Showing results 1 — 15 out of 262,286 results