1538 search results - page 52 / 308 » Spectral Techniques in Graph Algorithms |
JMLR
2006
13 years 10 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
JPDC
1998
13 years 9 months ago
1998
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
RECOMB
2004
Springer
14 years 10 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
CAIP
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...
AMAI
2004
Springer
14 years 3 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...