Results 81 to 90 of about 2,709,850 (294)
The maximum satisfiability problem (MAX-SAT) is stated as follows: Given a boolean formula in CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAX-SAT is MAX-SNP-complete and received much attention recently. One of the challenges posed by Alber, Gramm and Niedermeier in a recent survey paper asks: Can MAX-SAT be ...
Hantao Zhang 0001 +2 more
openaire +3 more sources
Exact Algorithms for Linear Matrix Inequalities [PDF]
Let $A(x) = A_0+x_1A_1+\cdots+x_nA_n$ be a linear matrix, or pencil, generated by given symmetric matrices $A_0,A_1,\ldots,A_n$ of size $m$ with rational entries. The set of real vectors $x$ such that the pencil is positive semidefinite is a convex semialgebraic set called spectrahedron, described by a linear matrix inequality.
Henrion, Didier +2 more
openaire +6 more sources
Exact Inference with Approximate Computation for Differentially Private Data via Perturbations
This paper discusses how two classes of approximate computation algorithms can be adapted, in a modular fashion, to achieve exact statistical inference from differentially private data products.
Ruobin Gong
doaj
Tumour‐proximal deep serum proteomics identifies biomarkers associated with ovarian cancer
New biomarkers are needed for early ovarian cancer detection. Ovarian (tumour‐proximal) and peripheral vein serum from healthy women and patients with benign or malignant tumours underwent nanoparticle‐enriched deep proteomics. Ovarian serum yielded more protein identifications and revealed tumour‐reflective signatures.
Darren Lau +9 more
wiley +1 more source
An exact algorithm for subgraph homeomorphism
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Lingas, Martin Wahlen
openaire +1 more source
RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz +6 more
wiley +1 more source
Exact Algorithms for Treewidth and Minimum Fill-In [PDF]
We show that the treewidth and the minimum fill-in of an n-vertex graph can be computed in time $\mathcal{O}(1.8899^n)$. Our results are based on combinatorial proofs that an n-vertex graph has $\mathcal{O}(1.7087^n)$ minimal separators and $\mathcal{O}(1.8135^n)$ potential maximal cliques.
Fedor V. Fomin +3 more
openaire +4 more sources
CPSP-tools – Exact and complete algorithms for high-throughput 3D lattice protein studies
Background The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. lattice proteins.
Will Sebastian +2 more
doaj +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
Asymptotically exact streaming algorithms
We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of the stream goes to infinity while the memory used by the algorithm is restricted to polylog(n) size. Thus, the output of the algorithm is optimal in the limit.
Marc Heinrich +2 more
openaire +2 more sources

