Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the prolif...
The construction and maintenance of data warehouses (views) in large-scale environments composed of numerous distributed and evolving information sources (ISs) such as the WWW has ...