3020 search results - page 527 / 604 » Optimal partition trees |
152
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
157
click to vote
CLOUD
2010
ACM
15 years 9 months ago
2010
ACM
Over the last 10–15 years, our industry has developed and deployed many large-scale Internet services, from e-commerce to social networking sites, all facing common challenges i...
138
Voted
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
148
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
164
click to vote
DCC
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper contains two contributions to very-low-bitrate video coding. First, we show that in contrast to common practice incremental techniques for rate-distortion optimization ...