Filters








2,129 Hits in 4.3 sec

Cache-Oblivious Dynamic Programming for Bioinformatics

Rezaul Alan Chowdhury, Hai-Son Le, Vijaya Ramachandran
2010 IEEE/ACM Transactions on Computational Biology & Bioinformatics  
We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alignment and 3-way sequence alignment  ...  For each of these problems we present cache-oblivious algorithms that match the best-known time complexity, match or improve the best-known space complexity, and improve significantly over the cache-efficiency  ...  ACKNOWLEDGMENT We thank Mike Brudno for the CFTR DNA sequences, Robin Gutell for the rRNA sequences, and David Zhao for the MED-Knudsen, MED-ukk.alloc and MED-ukk.checkp code.  ... 
doi:10.1109/tcbb.2008.94 pmid:20671320 fatcat:vn2vc4qlqnervbqj3veiyt36e4

Approximation Algorithms for Multiprocessor Scheduling under Uncertainty

Guolong Lin, Rajmohan Rajaraman
2010 Theory of Computing Systems  
Most notable is the model where each task has a duration of random length and may require different amount of resources. For related work, see [7, 6, 14, 29, 16, 11] .  ...  What is the objective function: makespan, weighted completion time, weighted flow time, etc.? See [13] for a survey and [12, 20, 28, 19, 4, 17] for representative work.  ...  Hence, an assignment function of a pseudo-schedule may map a machine to a set of jobs.  ... 
doi:10.1007/s00224-010-9250-2 fatcat:p5cjlb4zkneqzmoqll5njp2cvq

Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions [article]

Kaito Fujii
2020 arXiv   pre-print
The main application of our framework is sparse optimization, for which we show that restricted strong concavity and restricted smoothness of the objective function imply localizability, and further develop  ...  To analyze local search algorithms for set function maximization, we propose a new notion called localizability of set functions, which measures how effective local improvement is.  ...  The author is thankful to Takeru Matsuda and Kazuki Matoya for inspiring discussions. This study was supported by JSPS KAKENHI Grant Number JP 18J12405.  ... 
arXiv:2006.01400v1 fatcat:gaz2yxvvx5co5cyufw3ht7nsa4

ObliVM: A Programming Framework for Secure Computation

Chang Liu, Xiao Shaun Wang, Kartik Nayak, Yan Huang, Elaine Shi
2015 2015 IEEE Symposium on Security and Privacy  
ObliVM offers a powerful, expressive programming language and user-friendly oblivious programming abstractions.  ...  We develop various showcase applications such as data mining, streaming algorithms, graph algorithms, genomic data analysis, and data structures, and demonstrate the scalability of ObliVM to bigger data  ...  [13] and offers new features such as phantom functions, generic constants, random types, as well as native types and functions.  ... 
doi:10.1109/sp.2015.29 dblp:conf/sp/LiuWNHS15 fatcat:hpf5tvklujhebigki5iky6tpz4

Approximation algorithms for multiprocessor scheduling under uncertainty

Guolong Lin, Rajmohan Rajaraman
2007 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07  
Most notable is the model where each task has a duration of random length and may require different amount of resources. For related work, see [7, 6, 14, 29, 16, 11] .  ...  What is the objective function: makespan, weighted completion time, weighted flow time, etc.? See [13] for a survey and [12, 20, 28, 19, 4, 17] for representative work.  ...  Hence, an assignment function of a pseudo-schedule may map a machine to a set of jobs.  ... 
doi:10.1145/1248377.1248383 dblp:conf/spaa/LinR07 fatcat:z3pistditfduhpbqzyzqlbedea

Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP)

Roberto Battiti, Marco Protasi
1999 Discrete Applied Mathematics  
In addition, the use of non-oblivious functions recently proposed in the framework of approximation algorithms is investigated.  ...  The performance of H-RTS is compared with that of Simulated Annealing and simple Repeated Local Search. ? 0166-218X/99/$ -see front matter ? 1999 Elsevier Science B.V.  ...  Alimonti and G. P. Leonardi for their useful comments on a preliminary version of this paper.  ... 
doi:10.1016/s0166-218x(99)00030-x fatcat:a4llohtb7vhq3civhukh4itywu

Data-Oblivious Graph Algorithms in Outsourced External Memory [article]

Michael T. Goodrich, Joseph A. Simons
2014 arXiv   pre-print
None of our algorithms make use of constant-time random oracles.  ...  This approach facilitates collaboration and reliability over traditional frameworks, and it provides privacy protection, even though the server has full access to the data and he can monitor how it is  ...  Moreover, our methods are based on new techniques and novel adaptations of existing paradigms to the DO-OEM model (such as our bottom-up and top-down tree computations).  ... 
arXiv:1409.0597v1 fatcat:gw6dmyvrzbg5dib3gfdpso32la

An Efficient Approach for Privacy Preserving Data Mining using SMC Techniques and Related Algorithms

P. Annan Naidu
2018 International Journal for Research in Applied Science and Engineering Technology  
Data mining plays a major role in real world business applications by providing different techniques and algorithms.  ...  This paper describes about SMC role and its techniques along with algorithms.  ...  algorithm to generate pseudo-randomization number(r), as a result all the parties learn r. 2) One randomly selected party generates pseudo-randomization function and share it with all the parties and  ... 
doi:10.22214/ijraset.2018.4292 fatcat:s2o4bqevxvhgbiuxdkfon7czqm

Randomized Shellsort: A Simple Oblivious Sorting Algorithm [article]

Michael T. Goodrich
2010 arXiv   pre-print
Thus, randomized Shellsort is simultaneously simple, time-optimal, and data-oblivious.  ...  In this paper, we describe randomized Shellsort--a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in O(n log n) time and, as we show, succeeds in sorting any given  ...  Acknowledgments This research was supported in part by the National Science Foundation under grants 0724806, 0713046, and 0847968, and by the Office of Naval Research under MURI grant N00014-08-1-1015.  ... 
arXiv:0909.1037v3 fatcat:pi4tkv42hzbg5m6gpamdwucfvm

Randomized Shellsort: A Simple Oblivious Sorting Algorithm [chapter]

Michael T. Goodrich
2010 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms  
This algorithm is a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in O(n log n) time and succeeds in sorting any given input permutation with very high probability  ...  In this paper, we describe a randomized Shellsort algorithm.  ...  Acknowledgments This research was supported in part by the National Science Foundation under grants 0724806, 0713046, and 0847968, and by the Office of Naval Research under MURI grant N00014-08-1-1015.  ... 
doi:10.1137/1.9781611973075.101 dblp:conf/soda/Goodrich10 fatcat:wgokywvd2vdc7eu5ozgc3htine

A randomized, efficient, and distributed protocol for the detection of node replication attacks in wireless sensor networks

Mauro Conti, Roberto Di Pietro, Luigi Vincenzo Mancini, Alessandro Mei
2007 Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '07  
Third, we propose a new Randomized, Efficient, and Distributed (RED) protocol for the detection of node replication attacks and we show that it is completely satisfactory with respect to the requirements  ...  in the literature, and that it is resistant to the new kind of attacks we introduce in this paper, while other solutions are not.  ...  Using the pseudo-random function both b and b will select the same set of witness nodes, containing at least a node w.  ... 
doi:10.1145/1288107.1288119 dblp:conf/mobihoc/ContiPMM07 fatcat:z75v2ghcnzbo7jw7pfzvboe62e

Data-oblivious graph algorithms for secure computation and outsourcing

Marina Blanton, Aaron Steele, Mehrdad Alisagari
2013 Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security - ASIA CCS '13  
This work treats the problem of designing data-oblivious algorithms for classical and widely used graph problems.  ...  A data-oblivious algorithm is defined as having the same sequence of operations regardless of the input data and dataindependent memory accesses.  ...  The pseudo-code for oblivious implementation of this step is: 4. Update the minimum spanning tree by setting V = V ∪ {imin}, E = E ∪ {([Ci min .parent], [imin])}, and v = imin.  ... 
doi:10.1145/2484313.2484341 dblp:conf/ccs/BlantonSA13 fatcat:m7h5crkj2nefhbcw5pbfu2hr5a

More efficient oblivious transfer and extensions for faster secure computation

Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
A foundation for secure computation is oblivious transfer (OT), which traditionally requires expensive public key cryptography.  ...  Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result.  ...  We thank David Evans and the anony-  ... 
doi:10.1145/2508859.2516738 dblp:conf/ccs/AsharovL0Z13 fatcat:k274ljin3zayviyenztorqd3p4

The Benefit of Sex in Noisy Evolutionary Search [article]

Tobias Friedrich and Timo Kötzing and Martin Krejca and Andrew M. Sutton
2015 arXiv   pre-print
The benefit of sexual recombination is one of the most fundamental questions both in population genetics and evolutionary computation.  ...  We present the first result, which rigorously proves that it is beneficial to use sexual recombination in an uncertain environment with a noisy fitness function.  ...  Note that the functions for the non-noise-oblivious algorithms have deterministic function values whereas the ones for the noise-oblivious versions are random variables.  ... 
arXiv:1502.02793v1 fatcat:antfl32hjnc2pmnledrmqrtlyy

Hybrid Algorithm for Resource Provisioning of Multi-tier Cloud Computing

Marwah Hashim Eawna, Salma Hamdy Mohammed, El-Sayed M. El-Horbaty
2015 Procedia Computer Science  
The simulation results show that resource provisioning based on PSO-SA algorithm in multi-tier application is much faster than resource provisioning in multitier application based on PSO algorithm and  ...  Cloud computing is a model for delivering information technology services in which resources are retrieved from the internet through web-based tools and applications.  ...  Fig. 1 : 1 The pseudo code of PSO algorithm in Single tier application Fig. 3 : 3 The pseudo code of PSO-SA algorithm in single tier application Fig. 4 : 4 The pseudo code of PSO algorithm in multi-tier  ... 
doi:10.1016/j.procs.2015.09.012 fatcat:yl5oifv4uncaflqncr7ky6ijhm
« Previous Showing results 1 — 15 out of 2,129 results