1951 search results - page 105 / 391 » An algorithm for improving graph partitions |
163
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
142
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
133
click to vote
EGH
2004
Springer
15 years 9 months ago
2004
Springer
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
157
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
In current peer-to-peer file sharing networks, a large number of peers with heterogeneous connections simultaneously seek to download resources, e.g., files or file fragments, from...
115
click to vote
ICNC
2005
Springer
15 years 10 months ago
2005
Springer
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...