Results 11 to 20 of about 1,861,121 (138)

Communication: The distinguishable cluster approximation [PDF]

open access: yesThe Journal of Chemical Physics, 2013
We present a method that accurately describes strongly correlated states and captures dynamical correlation. It is derived as a modification of coupled-cluster theory with single and double excitations (CCSD) through consideration of particle distinguishability between dissociated fragments, whilst retaining the key desirable properties of particle ...
Kats, Daniel, Manby, Frederick R.
openaire   +4 more sources

Maximum Coverage with Cluster Constraints:An LP-Based Approximation Technique [PDF]

open access: yes, 2021
Packing problems constitute an important class of optimization problems. However, despite the large number of variants that have been studied in the literature, most packing problems encompass a single tier of capacity restrictions only.
Zweers, B.G.   +5 more
core   +2 more sources

Approximate Clustering without the Approximation [PDF]

open access: yesProceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Approximation algorithms for clustering points in metric spaces is a flourishing area of research, with much research effort spent on getting a better understanding of the approximation guarantees possible for many objective functions such as k-median, k-means, and min-sum clustering. This quest for better approximation algorithms is further fueled by
Maria-Florina Balcan   +2 more
openaire   +2 more sources

Approximate Kernel Clustering [PDF]

open access: yes2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
In the kernel clustering problem we are given a large $n\times n$ positive semi-definite matrix $A=(a_{ij})$ with $\sum_{i,j=1}^na_{ij}=0$ and a small $k\times k$ positive semi-definite matrix $B=(b_{ij})$. The goal is to find a partition $S_1,...,S_k$ of $\{1,...
Subhash Khot, Assaf Naor
openaire   +4 more sources

Algorithms and error bounds for multivariate piecewise constant approximation [PDF]

open access: yes, 2011
We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewise constants. This covers for example the Sobolev-Poincar´e inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree ...
Davydov, Oleg
core   +3 more sources

Exact and Approximation Algorithms for Clustering [PDF]

open access: yesAlgorithmica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pankaj K. Agarwal   +1 more
openaire   +1 more source

Approximate Group Fairness for Clustering

open access: yesCoRR, 2022
We incorporate group fairness into the algorithmic centroid clustering problem, where $k$ centers are to be located to serve $n$ agents distributed in a metric space. We refine the notion of proportional fairness proposed in [Chen et al., ICML 2019] as {\em core fairness}, and $k$-clustering is in the core if no coalition containing at least $n/k ...
Bo Li 0037   +4 more
openaire   +3 more sources

Coupled cluster cavity Born-Oppenheimer approximation for electronic strong coupling

open access: yes, 2023
<p>File to recreate the findings in: Coupled cluster cavity Born-Oppenheimer approximation for electronic strong coupling</p ...
Angelico, Sara   +3 more
core   +1 more source

Clustering under approximation stability [PDF]

open access: yesJournal of the ACM, 2013
A common approach to clustering data is to view data objects as points in a metric space, and then to optimize a natural distance-based objective such as the k -median, k -means, or min-sum score.
Maria-Florina Balcan   +2 more
openaire   +1 more source

Efficient approximation of random fields for numerical applications [PDF]

open access: yes, 2014
This article is dedicated to the rapid computation of separable expansions for the approximation of random fields. We consider approaches based on techniques from the approximation of non-local operators on the one hand and based on the pivoted Cholesky ...
Michael Peters   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy