Sciweavers

433 search results - page 58 / 87
» Generalized Ham-Sandwich Cuts
Sort
View
EMMCVPR
2001
Springer
14 years 2 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi
ASPDAC
1999
ACM
122views Hardware» more  ASPDAC 1999»
14 years 2 months ago
A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
Shiuann-Shiuh Lin, Wen-Hsin Chen, Wen-Wei Lin, Tin...
MP
1998
109views more  MP 1998»
13 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
INFOCOM
2010
IEEE
13 years 8 months ago
Reliability in Layered Networks with Random Link Failures
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
Kayi Lee, Hyang-Won Lee, Eytan Modiano
SIAMCOMP
2010
120views more  SIAMCOMP 2010»
13 years 8 months ago
Edge Disjoint Paths in Moderately Connected Graphs
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
Satish Rao, Shuheng Zhou