Filters








11,359 Hits in 4.1 sec

Towards Tight Lower Bounds for Range Reporting on the RAM [article]

Allan Grønlund, Kasper Green Larsen
2014 arXiv   pre-print
In this paper we make progress towards closing the gap between the upper and lower bounds for range reporting by proving cell probe lower bounds for ball-inheritance.  ...  Our lower bounds are tight for a large range of parameters, excluding any further progress for range reporting using the ball-inheritance reduction.  ...  Our Results In this paper, we prove a lower bound for the ball-inheritance problem. Our lower bound is tight for a large range of parameters and is as follows: Theorem 2.  ... 
arXiv:1411.0644v1 fatcat:uay6mss2jnd75o7d24batyoyi4

Towards Tight Lower Bounds for Range Reporting on the RAM

Allan Grønlund, Kasper Green Larsen, Marc Herbstritt
2016 International Colloquium on Automata, Languages and Programming  
In this paper we make progress towards closing the gap between the upper and lower bounds for range reporting by proving cell probe lower bounds for ballinheritance.  ...  Our lower bounds are tight for a large range of parameters, excluding any further progress for range reporting using the ball-inheritance reduction. * Aarhus University. jallan@cs.au.dk.  ...  Our Results In this paper, we prove a lower bound for the ball-inheritance problem. Our lower bound is tight for a large range of parameters and is as follows: Theorem 2.  ... 
doi:10.4230/lipics.icalp.2016.92 dblp:conf/icalp/GronlundL16 fatcat:l47bqzds2rdwhatbfqupsx424y

Towards Tight Lower Bounds for Range Reporting on the RAM * †

Allan Grønlund, Kasper Larsen
unpublished
In this paper we make progress towards closing the gap between the upper and lower bounds for range reporting by proving cell probe lower bounds for ball-inheritance.  ...  Our lower bounds are tight for a large range of parameters, excluding any further progress for range reporting using the ball-inheritance reduction. 1 Introduction In the orthogonal range reporting problem  ...  More specifically, Chazelle [7] presented a pointer machine data structure answering queries in 92:2 Towards Tight Lower Bounds for Range Reporting on the RAM optimal O(lg n + k) time using O(n lg  ... 
fatcat:hjbiztfobva2tgq6olnwcftgy4

Near-Optimal Range Reporting Structures for Categorical Data [chapter]

Kasper Green Larsen, Freek van Walderveen
2013 Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms  
For the word-RAM, we obtain optimal data structures for three-sided range reporting, as well as improved upper bounds for four-sided range reporting.  ...  Finally, we show a tight lower bound on onedimensional categorical range counting using an elegant reduction from (standard) two-dimensional range counting.  ...  This establishes a tight Ω(lg N/ lg lg N ) query time lower bound for any categorical range counting data structure in the word-RAM that uses N lg O(1) N space.  ... 
doi:10.1137/1.9781611973105.20 dblp:conf/soda/LarsenW13 fatcat:rqie3ekeqbbgjchtoq7bitms5q

Robust and Adaptive Sequential Submodular Optimization [article]

Vasileios Tzoumas, Ali Jadbabaie, George J. Pappas
2020 arXiv   pre-print
Particularly, RAM has both provable per-instance a priori bounds and tight and/or optimal a posteriori bounds.  ...  However, in this paper we propose Robust and Adaptive Maximization (RAM), the first scalable algorithm. RAM runs in an online fashion, adapting in every step to the history of failures.  ...  ACKNOWLEDGEMENTS We thank Rakesh Vohra of the University of Pennsylvania, and Luca Carlone of the Massachusetts Institute of Technology for inspiring comments and discussions.  ... 
arXiv:1909.11783v3 fatcat:27gfhyqk4jh43n466osj2xqjxu

Computational Experience with Piecewise Linear Relaxations for Petroleum Refinery Planning

Zaid Ashraf Rana, Cheng Seong Khor, Haslinda Zabiri
2021 Processes  
between relaxation size and tightness does not always hold for non-uniform partition sizes.  ...  It was also seen that there is a limit on the number of partitions that contribute to relaxation tightness, which does not necessarily correspond to a larger number of partitions, while a direct relationship  ...  When γ → 0 , the partitions (i.e., grid points) tend to accumulate toward the domain upper bound; conversely, for γ →∞, the partitions accumulate toward the domain lower bound.  ... 
doi:10.3390/pr9091624 fatcat:nvovdz5h6bh77m2r5dllzxbdhi

Reduced cost-based ranking for generating promising subproblems [article]

M. Milano, W.J. van Hoeve
2004 arXiv   pre-print
Concerning the proof of optimality, we exploit a way to increase the lower bound for subproblems at higher discrepancies.  ...  We show experimental results on the TSP and its time constrained variant to show the effectiveness of the proposed approach, but the technique could be generalized for other problems.  ...  Acknowledgements We would like to thank Filippo Focacci and Andrea Lodi for useful discussion, suggestions and ideas.  ... 
arXiv:cs/0407044v1 fatcat:jnqmlzvzkzg5pggxtkrxofxl2m

Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting

Rasmus Pagh, Jakob Pagter
2001 BRICS Report Series  
A result of Beame shows that the lower bound also holds for non-comparison-based algorithms, but no algorithm has met this for time below the comparison-based <br />Omega(n lg n) lower bound.  ...  </p><p>Our results imply that recent lower bounds for deciding element distinctness in o(n lg n) time are nearly tight.</p>  ...  Upper bounds Sorting on the word RAM.  ... 
doi:10.7146/brics.v8i2.20456 fatcat:rwpxz6debvfkbhvqffikcbfcp4

PowerRanger: Assessing circuit vulnerability to power attacks using SAT-based static analysis

Jeff Hao, Valeria Bertacco
2009 2009 IEEE International High Level Design Validation and Test Workshop  
In this paper, we propose PowerRanger, a technique based on Boolean satisfiability to produce tight upper and lower bounds on both maximum and minimum power dissipation.  ...  By monitoring the power dissipation of a core, an attacker can extract secret keys used for encryption.  ...  It is used to compute the upper bound on the maximum switching activity and the lower bound on the minimum.  ... 
doi:10.1109/hldvt.2009.5340174 dblp:conf/hldvt/HaoB09 fatcat:yrgl7ewf3nc6tcua4ezedp7zha

Reduced Cost-Based Ranking for Generating Promising Subproblems [chapter]

Michela Milano, Willem J. van Hoeve
2002 Lecture Notes in Computer Science  
Concerning the proof of optimality, we exploit a way to increase the lower bound for subproblems at higher discrepancies.  ...  We show experimental results on the TSP and its time constrained variant to show the effectiveness of the proposed approach, but the technique could be generalized for other problems.  ...  Acknowledgements We would like to thank Filippo Focacci and Andrea Lodi for useful discussion, suggestions and ideas.  ... 
doi:10.1007/3-540-46135-3_1 fatcat:iotz7p5o7raxjmhhpjkvzgjuri

Achievable PID performance using sums of squares programming

Antonius Yudi Sendjaja, Vinay Kariwala
2009 Journal of Process Control  
The tightness of the proposed bounds is demonstrated using several benchmark examples drawn from literature.  ...  In this paper, we present a global lower bound on the achievable PID performance, defined in terms of output variance, by solving a series of convex programs using sums of squares programming.  ...  Acknowledgements The authors gratefully acknowledge the financial support from Office of Research, Nanyang Technological University, Singapore.  ... 
doi:10.1016/j.jprocont.2008.12.005 fatcat:dem2non5v5ct3h6baki7shunna

Mechanism of allosteric activation of human mRNA cap methyltransferase (RNMT) by RAM: insights from accelerated molecular dynamics simulations

2019 Nucleic Acids Research  
By employing the network community analyses, we revealed the underlying long-range allosteric networks and paths that are crucial for allosteric regulation by RAM.  ...  The RNA guanine-N7 methyltransferase (RNMT) in complex with RNMT-activating miniprotein (RAM) catalyses the formation of a N7-methylated guanosine cap structure on the 5' end of nascent RNA polymerase  ...  One of the simulated systems (system 5 in Table 1 ) contained only the cap bound to RNMT-RAM, but not AdoMet.  ... 
doi:10.1093/nar/gkz613 pmid:31329932 pmcid:PMC7145595 fatcat:2p3spyvlsfd3vikzmif7psowm4

A Survey on Priority Queues [chapter]

Gerth Stølting Brodal
2013 Lecture Notes in Computer Science  
Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority queues has taken the last 50 years.  ...  Center for Massive Data Algorithms, a Center of the Danish National Research Foundation. 1 We let lg x denote the binary logarithm of x. 2 In the following we denote a data structure storing O(1) words  ...  Acknowledgment The author would like to thank Rolf Fagerberg, Andy Brodnik, Jyrki Katajainen, Amr Elmasry, Jesper Asbjørn Sindahl Nielsen and the anonymous reviewers for valuable input.  ... 
doi:10.1007/978-3-642-40273-9_11 fatcat:zocxhiyfmvdgzn2yoob25h3wr4

Software radio architecture: a mathematical perspective

J. Mitola
1999 IEEE Journal on Selected Areas in Communications  
The bounded recursive functions, a subset of the total recursive functions, are shown to be the largest class of Turing-computable functions for which software radios exhibit provable stability in plug-andplay  ...  Establishing provable properties requires a mathematical perspective on the software radio architecture.  ...  Theorems outlined below use the recursive function and the RAM models to establish tight upper bounds on processing resources, a necessary condition for predictable throughput. B.  ... 
doi:10.1109/49.761033 fatcat:lys4vi3tobgm5kbphoewvjery4

Mechanism of allosteric activation of human mRNA cap methyltransferase (RNMT) by RAM: Insights from accelerated molecular dynamics simulations [article]

Juan A. Bueren-Calabuig, Marcus Bage, Victoria H. Cowling, Andrei V. Pisliakov
2019 bioRxiv   pre-print
By employing the dynamic network and community analyses, we revealed the underlying long-range allosteric networks and paths that are crucial for allosteric regulation by RAM.  ...  The RNA guanine-7 methyltransferase (RNMT) in complex with RNMT-Activating Miniprotein (RAM) catalyses the formation of a N7-methylated guanosine cap structure on the 5' end of nascent RNA polymerase II  ...  The population of this state is slightly lower than of the "closed" state, and the barrier on the path between the two is low (1.5 kcal/mol).  ... 
doi:10.1101/558502 fatcat:ac4bk5x3grejldmfyzj4dlfyym
« Previous Showing results 1 — 15 out of 11,359 results