131 Hits in 5.9 sec

Log-Concave Polynomials IV: Approximate Exchange, Tight Mixing Times, and Near-Optimal Sampling of Forests [article]

Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant, Thuy Duong Vuong
2021 arXiv   pre-print
We prove tight mixing time bounds for natural random walks on bases of matroids, determinantal distributions, and more generally distributions associated with log-concave polynomials.  ...  The best known result for sampling random forest was a FPAUS with high polynomial runtime recently found by . For spanning tree, we improve on the almost-linear time algorithm by [Sch18].  ...  The proved that M ♮ -concavity of log µ, equivalent to 1-approximate exchange property, implies that the generating polynomial of µ is log-concave.  ... 
arXiv:2004.07220v2 fatcat:in4iduogrvfnveykm2e54j4z24

Forty-First Annual Meeting March 2-6, 1997 Ernest N. Morial Convention Center New Orleans, Louisiana. Wednesday Symposia and Posters, Part IV

1997 Biophysical Journal  
Switching between two buffers containing two different ligands allowed us to record ATR Infrared spectra of structural and chemical intermediates relevant of the catalytic cycle of the enzyme.  ...  These ATPases are thought to share a common mechanism and a common structure. However, lithe is known about their structure and ractions which couple ATP hydrolysis to cation transport.  ...  sample, which prevents periodic heating of the sample and build-up of a phase gratng that would relax via thermal diffusion on the microsecond time scale.  ... 
doi:10.1016/s0006-3495(97)78743-5 fatcat:j2mf5gwwijc43lzz7zpueyie4m

14th International Symposium on Mathematical Programming

1990 Mathematical programming  
It is shown that for the success of the variant dom must ful ll a regularity property and that the choice of the normal vectors must meet some demands.Both requirements are ful lled if dom is polyhedral  ...  Finally I report numerical results of a comparison between the variant and a minimization approach using penalty functions.  ...  weight spanning tree and minimum bottleneck w eight spanning tree respectively.  ... 
doi:10.1007/bf01580875 fatcat:3jtclwmntzgjxkqs5uecombdaa

PhD Dissertation: Generalized Independent Components Analysis Over Finite Alphabets [article]

Amichai Painsky
2018 arXiv   pre-print
We propose several theorems and show that this hard problem can be accurately solved with a branch and bound search tree algorithm, or tightly approximated with a series of linear problems.  ...  Our contribution provides the first efficient set of solutions to Barlow's problem with theoretical and computational guarantees.  ...  Acknowledgements First and foremost I would like to express my gratitude and love to my wife Noga and my new born daughter Ofri, who simply make me happy every single day.  ... 
arXiv:1809.05043v4 fatcat:qo5cl7ui7zeetcpijrg43skkli

Minimum color‐degree perfect b ‐matchings

Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs
2020 Networks  
Session chairs are encouraged to be cruel and despotic as regards times allotted, since there are parallel sessions.  ...  Schrader, and Graphs III (Wed 20, Room PP, 9:30-10:30) chaired by R. Cordone. Session chairs must remind speakers to load up slides on laptops, and keep the sessions on time.  ...  Preliminary tests were carried out on a set of challenging instances with tight AFS capacity and on average 15 customers and 3 AFSs.  ... 
doi:10.1002/net.21974 fatcat:4qgtutmxrrcy7anvxks4fivcii

Bayesian binary quantile regression for the analysis of Bachelor-to-Master transition

Cristina Mollica, Lea Petrella
2016 Journal of Applied Statistics  
The working group (WG) CMStatistics comprises a number of specialized teams in various research areas of computational and methodological statistics.  ...  The Econometrics and Statistics (EcoSta) and Computational Statistics & Data Analysis (CSDA) are the official journals of the CMStatistics.  ...  Nevertheless, we show that whenever a conditional IV exists, so does an ancestral IV, and ancestral IVs can be found in polynomial time.  ... 
doi:10.1080/02664763.2016.1263835 fatcat:l5eyielgxrct7hq5ljqeej5ccy

Causality and Generalizability: Identifiability and Learning Methods [article]

Martin Emil Jakobsen
2021 arXiv   pre-print
Finally, we present heuristic ideas for learning summary graphs of nonlinear time-series models.  ...  This connection leads us to prove that general K-class estimators possess distributional robustness properties.  ...  PB and JP thank David Bürge and Jan Ernest for helpful discussions on exploiting Chu-Liu-Edmonds' algorithm for causal discovery during the early stages of this project.  ... 
arXiv:2110.01430v1 fatcat:c4w4wjt3wbfnhkyfcgflxaskye

The Quadratic Assignment Problem [chapter]

Rainer E. Burkard, Eranda Çela, Panos M. Pardalos, Leonidas S. Pitsoulis
1998 Handbook of Combinatorial Optimization  
It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases  ...  The paper will appear in the Handbook of Combinatorial Optimization to be published by Kluwer Academic Publishers, P. Pardalos and D.-Z. Du, eds.  ...  The appropriate sorting of the rows and columns of F and D can be done in O(n 2 log n) time.  ... 
doi:10.1007/978-1-4613-0303-9_27 fatcat:mm3iphjj4bhv5htk2rtljohu2i

Multiagent systems: algorithmic, game-theoretic, and logical foundations

2009 ChoiceReviews  
and enemies 48 3.1.2 Preferences and utility 49 3.2 Games in normal form 54 3.2.1 Example: the TCP user's game 54 iv Contents 3.2.2 Definition of games in normal form 55 3.2.3 More examples of normal-form  ...  a sample Nash equilibrium 91 4.2.2 An LCP formulation and the Lemke-Howson algorithm 93 4.2.3 Searching the space of supports 101 4.2.4 Beyond sample equilibrium computation 104 4.3 Computing Nash equilibria  ...  This means that we must introduce further restrictions on these models in order to capture this property, and any other property about the interaction between knowledge and belief that we care about.  ... 
doi:10.5860/choice.46-5662 fatcat:pr2pmv7k2bad3pp5bxgogecgnq

Decoding Protocols for Classical Communication on Quantum Channels [article]

Matteo Rosati
2017 arXiv   pre-print
First, we treat the problem from an abstract perspective, presenting a method to decompose any quantum measurement into a sequence of easier nested measurements through a binary-tree search.  ...  Second, we consider a more practical approach and describe three receiver structures for coherent states of the electromagnetic field with applications to single-mode state discrimination and multi-mode  ...  S(|ψ⟩⟨ψ|) = 0, and its maximum on the completely mixed state, i.e., S(1/d) = log d.  ... 
arXiv:1710.08638v1 fatcat:ntvu72onhzf4xpztlhlnyi2lra

Guaranteed Local Maximum Likelihood Detection of a Change Point in Nonparametric Logistic Regression

A. Vexler, G. Gurevich
2006 Communications in Statistics - Theory and Methods  
Exchanges.  ...  and consider the asymptotic properties of this estimator.  ...  mixing and strongly dependent processes.  ... 
doi:10.1080/03610920500498923 fatcat:jxva2knaxvbpbfmovc7yfwwlhu

From Dependence to Causation [article]

David Lopez-Paz
2016 arXiv   pre-print
Machine learning is the science of discovering statistical dependencies in data, and the use of those dependencies to perform predictions.  ...  The algorithms presented in this thesis are scalable, exhibit strong theoretical guarantees, and achieve state-of-the-art performance in a variety of real-world benchmarks.  ...  log n Properties of RDC RDC enjoys some attractive properties.  ... 
arXiv:1607.03300v1 fatcat:img5m23n5ncx5mfejgqkjft2ua

Cache Optimization Models and Algorithms [article]

Georgios Paschos and George Iosifidis and Giuseppe Caire
2019 arXiv   pre-print
In light of the remarkable data traffic growth and the increasing number of rich-media applications, the impact of caching is expected to become even more profound than it is today.  ...  Storage resources and caching techniques permeate almost every area of communication networks today.  ...  there is a polynomial-time verifier.  ... 
arXiv:1912.12339v1 fatcat:tofgtzkzx5cudpepyhodwbvnnm

Hub Location Problems: The Location of Interacting Facilities [chapter]

Bahar Y. Kara, Mehmet R. Taner
2011 International Series in Operations Research and Management Science  
The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they  ...  Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden.  ...  Furthermore, he opined that the existing models at the time were ambiguous and debatable.  ... 
doi:10.1007/978-1-4419-7572-0_12 fatcat:skbs7zlmqjb5pk2swpw3yxemna

From Supervised to Unsupervised Support Vector Machines and Applications in Astronomy

Fabian Gieseke
2013 Künstliche Intelligenz  
More specifically, we will derive a polynomial-time approach that can compute exact solutions for special cases of both tasks.  ...  in the context of clustering hyperspectral image data. iv v  ...  Since the median of a set of n numbers can be found in linear time, the construction of such a tree can easily be performed in a recursive manner taking O(n log n) overall time [11] .  ... 
doi:10.1007/s13218-013-0248-1 fatcat:l5vooxszkfckfexzgezeremb2u
« Previous Showing results 1 — 15 out of 131 results