1951 search results - page 161 / 391 » An algorithm for improving graph partitions |
150
click to vote
SIAMSC
2010
14 years 11 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
152
Voted
PPAM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
137
click to vote
FUIN
2006
15 years 5 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
146
click to vote
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper presents techniques in clustering the sametopic news stories according to event themes. We model the relationship of stories with textual and visual concepts under the ...
130
Voted
TC
1998
15 years 4 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...