103 search results - page 9 / 21 » Graph partitioning using single commodity flows |
113
Voted
STOC
2006
ACM
16 years 23 days ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
105
click to vote
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
Decentralized information flow control (DIFC) is a promising model for writing programs with powerful, end-to-end security guarantees. Current DIFC systems that run on commodity ...
CLOUD
2010
ACM
15 years 5 months ago
2010
ACM
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise dat...
100
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
We propose a unified approach for summarization based on the analysis of video structures and video highlights. Our approach emphasizes both the content balance and perceptual qua...
109
Voted
ICCAD
2004
IEEE
15 years 9 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...