Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....
S. Pillay, Michael J. Ward, A. Peirce, Theodore Ko...
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...