1093 search results - page 99 / 219 » Clustering from Constraint Graphs |
141
Voted
IJCAI
2007
15 years 5 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
197
Voted
PAMI
2012
13 years 6 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
131
Voted
AI
2007
Springer
15 years 3 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
142
Voted
EUROPAR
2007
Springer
15 years 7 months ago
2007
Springer
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
135
Voted
ISMB
1993
15 years 4 months ago
1993
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...