1299 search results - page 35 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
SPDP
1991
IEEE
15 years 1 months ago
1991
IEEE
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
81
Voted
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
JCC
2008
14 years 9 months ago
2008
Abstract: This article presents a novel concept, the minimal molecular surface (MMS), for the theoretical modeling of biomolecules. The MMS can be viewed as a result of the surface...
CCCG
2001
14 years 11 months ago
2001
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
PERCOM
2004
ACM
15 years 9 months ago
2004
ACM
Connectivity is central to pervasive computing environments. We seek to catalyze a world of rich and diverse connectivity through technologies that drastically simplify the task o...