1951 search results - page 75 / 391 » An algorithm for improving graph partitions |
146
click to vote
CAEPIA
2003
Springer
15 years 9 months ago
2003
Springer
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
128
click to vote
CC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in...
194
click to vote
COLOGNETWENTE
2010
15 years 2 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
146
click to vote
JGAA
2008
15 years 4 months ago
2008
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
106
click to vote
IJCAI
2007
15 years 5 months ago
2007
Accurate entity resolution is sometimes impossible simply due to insufficient information. For example, in research paper author name resolution, even clever use of venue, title ...