1101 search results - page 139 / 221 » An Algorithm for the Graph Crossing Number Problem |
118
Voted
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
188
Voted
FOCS
1993
IEEE
15 years 6 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
142
Voted
ISPA
2007
Springer
15 years 8 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
127
Voted
DAC
2009
ACM
15 years 6 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
142
Voted
JPDC
2008
15 years 2 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...