Filters








243 Hits in 5.9 sec

Near-Linear Time Algorithm for n-fold ILPs via Color Coding [article]

Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2018 arXiv   pre-print
This leads to the first algorithm for n-fold ILPs with a running time that is near-linear in the number nt of variables, namely (rsΔ)^O(r^2s + s^2) L^2 · nt ^O(1)(nt), where L is the encoding length of  ...  We introduce a technique based on Color Coding, which allows us to compute these improving directions in logarithmic time after a single initialization step.  ...  Unfortunately, it is not known whether linear programming can be solved in near-linear time in the number of variables. Hence, it is an obstacle for obtaining a near-linear running time.  ... 
arXiv:1811.00950v1 fatcat:3gkpu5p3gvdqpk6z4aeriqqej4

Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding

Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2020 SIAM Journal on Discrete Mathematics  
This leads to the first algorithm for n-fold ILPs with a running time that is near-linear in the number nt of variables, namely (rs∆) O(r 2 s+s 2 ) L 2 · nt log O(1) (nt), where L is the encoding length  ...  Both, the number of iterations and the search for such an improving direction take time Ω(n), leading to a quadratic running time in n.  ...  Then we I C A L P 2 0 1 9 75:8 Near-Linear Time Algorithm for n-fold ILPs via Color Coding Layer L 0 Layer L 1 Layer L 2 Layer L k 2 Layer L k 2 +1 . . . . . . . . . . . . . . . . . .  ... 
doi:10.1137/19m1303873 fatcat:3ysplkmrw5gbfc7cdmvfkowau4

Speedy Colorful Subtrees [chapter]

W. Timothy J. White, Stephan Beyer, Kai Dührkop, Markus Chimani, Sebastian Böcker
2015 Lecture Notes in Computer Science  
We attack this problem on two fronts: by combining fast and eective reduction algorithms with a strong integer linear program (ILP) formulation of the problem, we achieve overall speedups of 9.4 fold and  ...  Computing these trees involves nding exact solutions to the NP-hard Maximum Colorful Subtree problem.  ...  L a (·, ·) can be computed via dynamic programming in O(n 2 ) time and space. It is also helpful to dene L a (u, v) := min (p,u)∈E L a (p, v).  ... 
doi:10.1007/978-3-319-21398-9_25 fatcat:j3yyby7tsfa5bip6p5gykcedwu

A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems

Jörg H. Kappes, Bjoern Andres, Fred A. Hamprecht, Christoph Schnörr, Sebastian Nowozin, Dhruv Batra, Sungwoong Kim, Bernhard X. Kausler, Thorben Kröger, Jan Lellmann, Nikos Komodakis, Bogdan Savchynskyy (+1 others)
2015 International Journal of Computer Vision  
Szeliski et al. published an influential study in 2006 on energy minimization methods for Markov Random Fields (MRF).  ...  This study provided valuable insights in choosing the best optimization technique for certain classes of problems.  ...  We thank Rick Szeliski and Pushmeet Kohli for inspiring discussions.  ... 
doi:10.1007/s11263-015-0809-x fatcat:62xje37yzffsfgw76hhflwiyt4

A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems [article]

Jörg H. Kappes, Bjoern Andres, Fred A. Hamprecht, Christoph Schnörr, Sebastian Nowozin, Dhruv Batra, Sungwoong Kim, Bernhard X. Kausler, Thorben Kröger, Jan Lellmann, Nikos Komodakis, Bogdan Savchynskyy, Carsten Rother
2014 arXiv   pre-print
Szeliski et al. published an influential study in 2006 on energy minimization methods for Markov Random Fields (MRF).  ...  This study provided valuable insights in choosing the best optimization technique for certain classes of problems.  ...  We thank Rick Szeliski and Pushmeet Kohli for inspiring discussions.  ... 
arXiv:1404.0533v1 fatcat:eh2mhtz2dngnjh4uhzscw2w7c4

An optimistic and conservative register assignment heuristic for chordal graphs

Philip Brisk, Ajay Kumar Verma, Paolo Ienne
2007 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems - CASES '07  
In many cases, OCC and IRC were able to find optimal or near-optimal solutions for these graphs. OCC ran 1.89x faster than IRC, on average.  ...  This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC).  ...  ACKNOWLEDGMENT We wish to thank Sebastian Hack for providing the optimal solutions reported in Section 5.  ... 
doi:10.1145/1289881.1289919 dblp:conf/cases/BriskVI07 fatcat:y534ekkjgfbnhdqdfm7nje7dce

It's Hard to Share: Joint Service Placement and Request Scheduling in Edge Clouds with Sharable and Non-Sharable Resources

Ting He, Hana Khamfroush, Shiqiang Wang, Tom La Porta, Sebastian Stein
2018 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)  
Our trace-driven simulations show that the proposed algorithms, especially the approximation algorithm, can achieve near-optimal performance, serving 2-3 times more requests than a baseline solution that  ...  We further show that the hardness is caused by the service placement subproblem, while the request scheduling subproblem is polynomial-time solvable via maximum-flow algorithms.  ...  ACKNOWLEDGMENT The authors would like to thank Konstantinos Poularakis for the insightfully constructed counterexample on the submodularity of the proposed objective function.  ... 
doi:10.1109/icdcs.2018.00044 dblp:conf/icdcs/0001KWPS18 fatcat:2zvqt5bdejcxdlhcgdk26hpyaq

Quantum Integer Programming (QuIP) 47-779: Lecture Notes [article]

David E. Bernal, Sridhar Tayur, Davide Venturelli
2021 arXiv   pre-print
of near term quantum and quantum-inspired computing in solving optimization problems.  ...  Originally created for Tepper School of Business course 47-779 (at CMU), these were also used for the course ID5840 (at IIT-Madras, by Professors Anil Prabhakar and Prabha Mandayam) whose students (listed  ...  Regan, Quantum Algorithms via Linear Algebra. A Primer , MIT Press, 2014.  ... 
arXiv:2012.11382v2 fatcat:kin4pzosivc53d5sf6qua4mu2m

Optically Controlled Laser-Plasma Electron Acceleration for Compact γ-Ray Sources [chapter]

Serge Y. Kalmykov, Xavier Davoine, Isaac Ghebregziabher, Bradley A. Shadwick
2018 Accelerator Physics - Radiation Safety and Applications  
laser pulses through a millimeter-length, dense plasma (n 0 $ 10 19 cm À3 ).  ...  Blue-shifting one stack component by a considerable fraction of the carrier frequency compensates for the frequency red shift imparted by the wake.  ...  À1 X N b i¼1 w i ð ∞ À∞ n  n  β i À Á exp iω t À n•r i t ð Þ=c ð Þ ð Þ dt 2 (6) Stacking suppresses dark current Propagation dynamics of a bi-color stack is entirely different from that of the quasimonochromatic  ... 
doi:10.5772/intechopen.71679 fatcat:dteemafp25aaxf3nvkleymwl5a

Hardware/software partitioning and pipelined scheduling on runtime reconfigurable FPGAs

Mingxuan Yuan, Zonghua Gu, Xiuqiang He, Xue Liu, Lei Jiang
2010 ACM Transactions on Design Automation of Electronic Systems  
We use the SMT solver Yices with Linear Integer Arithmetic (LIA) theory as the optimization engine for solving the two scheduling problems.  ...  In addition, we present an efficient heuristic algorithm based on kernel recognition for the pipelined scheduling problem, a technique borrowed from SW pipelining, to overcome the scalability problem of  ...  So the overall algorithm complexity is O(N 2 M ).  ... 
doi:10.1145/1698759.1698763 fatcat:xnur36bxt5hhja2uh7v5hjqnaq

Machine Learning-Based Routing and Wavelength Assignment in Software-Defined Optical Networks

Ignacio Martin, Sebastian Troia, Jose Alberto Hernandez, Alberto Rodriguez, Francesco Musumeci, Guido Maier, Rodolfo Alvizu, Oscar Gonzalez de Dios
2019 IEEE Transactions on Network and Service Management  
Then, the time improvement over the ILP solution can be computed as follows: Impr = t ILP − (N feasible * t ML + N unfeasible * t ILP ) t ILP (8.3) where t ILP and t ML correspond to the time used by the  ...  Moreover, linear ML models may be faster than DNN but they often report more unfeasible cases that require a full ILP cycle for a feasible RWC penalizing the models' time performance.  ... 
doi:10.1109/tnsm.2019.2927867 fatcat:or3lhqdqbnas3cztwkqr5ykhhq

DNA-Templated Synthesis Optimization [chapter]

Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk
2017 Lecture Notes in Computer Science  
Finally, the algorithm runs in linear time.  ...  We have presented optimal and near-optimal methods for minimizing the number of tags and/or the number of strands, and demonstrate how integer linear program-First OC Second OC Algorithm Tags on Compounds  ...  The actual names of the compounds is not used in any of our algorithms, but for illustration, assume the base compounds are A, B, C, and D.  ... 
doi:10.1007/978-3-319-66799-7_2 fatcat:ht5df2tmkjht7bpsgkeyk3o2bq

Algorithms and Scheduling Techniques for Exascale Systems (Dagstuhl Seminar 13381)

Henri Casanova, Yves Robert, Uwe Schwiegelshohn, Marc Herbstritt
2014 Dagstuhl Reports  
As a result, many of the proven algorithmic techniques used in parallel computing for decades will not be effective in Exascale systems unless they are adapted or in some cases radically changed.  ...  The Dagstuhl seminar "Algorithms and Scheduling Techniques for Exascale Systems" was aimed at sharing open problems, new results, and prospective ideas broadly connected to the Exascale problem.  ...  We use a stochastic model (random variable) for the execution time of each task on each type of core in the system.  ... 
doi:10.4230/dagrep.3.9.106 dblp:journals/dagstuhl-reports/CasanovaRS13 fatcat:766ug56f5ndodox4ghazpljmei

About the Authors

2012 Psychological Science in the Public Interest  
This is especially important for unbalanced classes as is often the case for the cell line panel, where we observed that, for most drugs, the bulk of cell lines are not .  ...  We present 'Logic Optimization for Binary Input to Continuous Output' (LOBICO), a computational approach that infers small and easily interpretable logic models of binary input features that explain a  ...  Acknowledgements TAK would like to thank Bob Duin for fruitful discussions. TAK and FI would like to thank Julio Saez Rodriguez for fruitful discussions.  ... 
doi:10.1177/1529100612459637 fatcat:5ljm3kuabnbuzmvdbuwhhgyxqi

Learning RGB-D descriptors of garment parts for informed robot grasping

Arnau Ramisa, Guillem Alenyà, Francesc Moreno-Noguer, Carme Torras
2014 Engineering applications of artificial intelligence  
We also contribute a new, annotated, garment part dataset that can be used for benchmarking classification, part detection, and segmentation algorithms.  ...  The dataset is used to evaluate our approach and several state-ofthe-art 3D descriptors for the task of garment part detection.  ...  However, the computational cost of this descriptor makes FINDDD -which attained comparable results, specially when combined with SIFT-an interesting alternative for near real time applications.  ... 
doi:10.1016/j.engappai.2014.06.025 fatcat:g7fauqmnxrasdhqaj7nlfmzn7q
« Previous Showing results 1 — 15 out of 243 results