A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Bridging between 0/1 and Linear Programming via Random Walks
[article]
2019
arXiv
pre-print
Preserved Fulltext
In this work, we give a natural algorithmic bridging between these extremes of 0-1 and linear programming. ...
as a multiplicative potential to measure progress, a judicious choice of starting distribution, and a time varying distribution for the evolution of the random walk that is itself computed via an LP at ...
Acknowledgments We thank Brian Axelrod, Dima Kogan and anonymous reviewers for helpful feedback on the manuscript. ...
arXiv:1904.04860v1
fatcat:mru5bc6lhnh5tjn2sfyxoyhuqe
Constrained Counting and Sampling: Bridging the Gap between Theory and Practice
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, privacy, probabilistic reasoning, and constrained-random verification ...
By exploiting the connection between definability of formulas and variance of the distribution of solutions in a cell defined by 3-universal hash functions, we introduced an algorithmic technique, MIS, ...
The proof is now completed by showing that w m,y,α ≥ (1 − e −1 )/2 m for every α ∈ {0, 1} m and y ∈ {0, 1} n . Towards this end, let us first fix a random y. ...
arXiv:1806.02239v1
fatcat:3tgo2z4tkjbxjfwql6v4725d3i
Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
graph via computationally expensive matrix factorization techniques. ...
Current graph embedding approaches either sample a large number of node pairs from a graph to learn node embeddings via stochastic optimization or factorize a high-order proximity/adjacency matrix of the ...
nodes) and have a higher probability to be closer in random walk sequences. ...
arXiv:1912.08808v1
fatcat:e5yhpvy2hfej7kxndykmit5xte
Confidence Is the Bridge between Multi-stage Decisions
2016
Current Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The findings reveal a novel role for confidence and a degree of flexibility, hitherto unknown, in the brain's ability to rapidly and precisely modify the mechanisms that control the termination of a decision ...
Subjects made two perceptual decisions sequentially and were rewarded only if they made both correctly. ...
ACKNOWLEDGMENTS We thank the Wellcome Trust, the Human Frontier Science Program, the Royal Society (Noreen Murray Professorship in Neurobiology to D.M.W.), Howard Hughes Medical Institute, National Eye ...
doi:10.1016/j.cub.2016.10.021
pmid:27866891
pmcid:PMC5154755
fatcat:t37k5hpfz5hp7gkqdtvrys6jsi
Bridging the Gap between Deep Learning and Frustrated Quantum Spin System for Extreme-scale Simulations on New Generation of Sunway Supercomputer
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
and unprecedented scales. ...
convolutional neural network (CNN) for simulating the two-dimensional highly frustrated spin-1/2 J_1-J_2 Heisenberg model, meanwhile the simulation is performed at an extreme scale system with low cost and ...
ACKNOWLEDGMENTS We sincerely thank the editors and the reviewers for their careful reading and thoughtful comments. ...
arXiv:2108.13830v4
fatcat:hsnlbonfezgmlhbkzzvy7oifli
Dissipative particle dynamics: Bridging the gap between atomistic and mesoscopic simulation
1997
Journal of Chemical Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We have established useful parameter ranges for simulations, and have made a link between these parameters and -parameters in Flory-Huggins-type models. ...
As an example application, we have calculated the interfacial tension between homopolymer melts as a function of and N and have found a universal scaling collapse when /k B T 0.4 is plotted against N for ...
We find that for Ͼ3 there is a very good linear relation between and ⌬a. ...
doi:10.1063/1.474784
fatcat:57mq7ttnrbhw5muvj3kudtgr4q
BWIBots: A platform for bridging the gap between AI and human–robot interaction research
2017
The international journal of robotics research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The article begins with a description of, and justification for, the hardware and software design decisions underlying the BWIBots, with the aim of informing the design of such platforms in the future. ...
The article concludes with a look forward towards future research opportunities and applications enabled by the BWIBot platform. ...
The authors would also like to thank many FRI students, and in particular, Yuqian Jiang, Rolando Fernandez, and Patricio Lankenau for their assistance in developing and maintaining the hardware and software ...
doi:10.1177/0278364916688949
fatcat:yqqm35v7lngxri5ef5fn7butam
From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces
2020
Innovations in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the 1970's, Lovász built a bridge between graphs and alternating matrix spaces, in the context of perfect matchings (FCT 1979). ...
In this paper, we lay the foundation for another bridge between graphs and alternating matrix spaces, in the context of independent sets and vertex colorings. ...
Wilson, and Gábor Ivanyos for discussions related to this paper. ...
doi:10.4230/lipics.itcs.2020.8
dblp:conf/innovations/BeiCGQS20
fatcat:s57l6dzewbfc5ljjxsg7xsv4fq
On the conformal walk dimension: Quasisymmetric uniformization for symmetric diffusions
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We introduce the notion of conformal walk dimension, which serves as a bridge between elliptic and parabolic Harnack inequalities. ...
We show that the conformal walk dimension of any MMD space satisfying the elliptic Harnack inequality is two, and provide a necessary condition for a pair of such changes to attain the infimum defining ...
Our results can be viewed as a bridge between analysis in smooth and fractal spaces and also as a bridge between elliptic and parabolic Harnack inequalities. ...
arXiv:2008.12836v2
fatcat:2at6rouvknhrbmcj3aazmmujim
Monte Carlo methods
2011
Wiley Interdisciplinary Reviews: Computational Statistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Figure 4 . 4 13: Conditional on
Algorithm 4. 15 ( 15 Brownian Bridge Sampling Between W t 0 and W t n+1 ) 1. Generate Z 1 , . . . , Z n iid ∼ N(0, 1). ...
Set d = α − 1/3 and c = 1/ √ 9 d. 2. Generate Z ∼ N(0, 1) and U ∼ U(0, 1) independently. 3. ...
z γ denotes the γ-quantile of the N(0, 1) distribution. ...
doi:10.1002/wics.194
fatcat:3622mmi4snfyhlp2t7meburnoa
Instrumentation-level improvements in shear-force near-field acoustic microscopy
2018
Journal of Physics, Conference Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Buffer amplifiers are used to drive the quartz tuning fork (that holds the probe) and to measure the AC and DC tunneling currents between the tip and sample. iv) To improve the signal to noise ratio, a ...
then automatically compensated (via linear interpolation) in the immediate subsequent probe's approach/retraction measurements. iii) To determine the absolute position of the substrate relative to the ...
Then the vibration of the tip is propagating through the bridge to the sample. The acoustic signal is modeled as a random walk with a small linear influence from the QTF. ...
doi:10.1088/1742-6596/1143/1/012013
fatcat:5hhreuwgcra2zmw4j7xnhb3g4e
Weakly directed self-avoiding walks
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating function. ...
This series has a complex singularity structure and in particular, is not D-finite. ...
For instance, in the horizontal model, a NES-pseudo-bridge of height k is not an arbitrary path with steps 0, ±1 going from 0 to k on the segment {0, 1, . . . , k}. ...
arXiv:1010.3200v2
fatcat:uxen2e44ujb75a2ubdquiecyty
Weakly directed self-avoiding walks
2011
Journal of combinatorial theory. Series A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating function. ...
This series has a complex singularity structure and in particular, is not D-finite. ...
For instance, in the horizontal model, a NES-pseudo-bridge of height k is not an arbitrary path with steps 0, ±1 going from 0 to k on the segment {0, 1, . . . ,k}. ...
doi:10.1016/j.jcta.2011.06.001
fatcat:pcrvrb3zi5gf7mdkanamhyznay
Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches
[article]
2020
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We first bridge the gap between TAP and CAP, by presenting techniques that allow for leveraging insights and methods from TAP to approach CAP. ...
Additionally, a feature we inherit from recent TAP advances is that our approach can deal with the weighted setting when the ratio between the largest to smallest cost on extra links is bounded, in which ...
We then consider the following linear program where a 2-cut can only be covered by links entering it: min ∈ L c x : x(δ − L (C)) ≥ 1 ∀C ∈ C G , x ∈ R L ≥0 . (1) One can observe that in the ...
doi:10.48550/arxiv.2012.00086
fatcat:zeatfb6iond35idysbwy6e3afm
Bounded discrete walks
2010
Discrete Mathematics & Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
International audience This article tackles the enumeration and asymptotics of directed lattice paths (that are isomorphic to unidimensional paths) of bounded height (walks below one wall, or between two ...
For a large class of walks, we give the discrete distribution of the height of bridges, and show the convergence to a Rayleigh limit law. ...
The simulations are done by drawing random non-conditional walks of length n and then by reversing jumps at uniformly chosen random positions until we obtain bridges. ...
doi:10.46298/dmtcs.2792
fatcat:3mkv6y6pbreozm6flwbwhpmhvm
« Previous
Showing results 1 — 15 out of 7,747 results