433 search results - page 66 / 87 » Generalized Ham-Sandwich Cuts |
SIGECOM
2011
ACM
13 years 17 days ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
ICCAD
1994
IEEE
14 years 1 months ago
1994
IEEE
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...
SGP
2007
14 years 5 days ago
2007
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
PASTE
2010
ACM
13 years 11 months ago
2010
ACM
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...