Results 71 to 80 of about 1,094,599 (317)
08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms [PDF]
, 2008 From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201 ``Design and Analysis of Randomized and Approximation Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Dyer, Martin E. +2 more
core +1 more source
Persisting randomness in randomly growing discrete structures: graphs and search trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values.
Rudolf Grübel
doaj +1 more source
ON THE EFFICIENCY OF ALGORITHMS OF ANALYSIS [PDF]
Bulletin of the American Mathematical Society, 1985 This paper is a kind of report on the author's preoccupations concerning the computational complexity. As the author declares, it is partly an exposition of recent results and new open problems, but also some new proofs are given here. There are four principal theorems, named A, B, C and D, twelve problems and many other theorems, lemmas and ...
openaire +3 more sources
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
05201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms [PDF]
, 2005 From 15.05.05 to 20.05.05, the Dagstuhl Seminar 05201 ``Design and Analysis of Randomized and Approximation Algorithms'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Dyer, Martin +2 more
core +1 more source
An analysis of a butterfly algorithm
Computers & Mathematics with Applications, 2017 Butterfly algorithms are an effective multilevel technique to compress discretizations of integral operators with highly oscillatory kernel functions. The particular version of the butterfly algorithm considered here realizes the transfer between levels by Chebyshev interpolation.
Steffen Börm +2 more
openaire +3 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
The cosparse analysis model and algorithms
, 2013 After a decade of extensive study of the sparse representation synthesis model, we can safely say that this is a mature and stable field, with clear theoretical foundations, and appealing applications.
Gribonval, Rémi +8 more
core +1 more source
Towards Understanding Clustering Problems and Algorithms: An Instance Space Analysis
, 2021 Various criteria and algorithms can be used for clustering, leading to very distinct outcomes and potential biases towards datasets with certain structures.
Kate Smith-Miles +2 more
core +1 more source
An algorithm for LET-analysis [PDF]
Physics in Medicine & Biology, 1972 An algorithm for the derivation of LET-distributions from pulse- height spectra obtained with proportional counters is described. The method is based on Fourier transformation: it is applicable to spherical as well as non-spherical proportional counters.
openaire +3 more sources