1022 search results - page 91 / 205 » Logspace Complexity of Functions and Structures |
129
click to vote
APPINF
2003
15 years 4 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
99
Voted
UAI
1996
15 years 4 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
118
click to vote
TCSB
2010
15 years 1 months ago
2010
Abstract. The process through which disordered components spontaneously arrange themselves into patterns is called self-assembly. Molecular self-assembly describes the process by w...
145
Voted
WIDM
2004
ACM
15 years 8 months ago
2004
ACM
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
123
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...