42 papers:
RTA-2015-Waldmann #matrix- Matrix Interpretations on Polyhedral Domains (JW), pp. 318–333.
VMCAI-2015-BjornerG #abstraction- Property Directed Polyhedral Abstraction (NB, AG), pp. 263–281.
STOC-2014-ChengJ- Shortest paths on polyhedral surfaces and terrains (SWC, JJ), pp. 373–382.
STOC-2014-ImKM #algorithm #constraints #scheduling- Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints (SI, JK, KM), pp. 313–322.
CGO-2014-VenkatSHS #code generation- Non-affine Extensions to Polyhedral Code Generation (AV, MS, MWH, MMS), p. 185.
PPoPP-2014-MehtaLY #framework- Revisiting loop fusion in the polyhedral framework (SM, PHL, PCY), pp. 233–246.
ASE-2013-SimburgerAGL #empirical #optimisation- The potential of polyhedral optimization: An empirical study (AS, SA, AG, CL), pp. 508–518.
DAC-2013-LiuYLW #modelling #optimisation- Polyhedral model based mapping optimization of loop nests for CGRAs (DL, SY, LL, SW), p. 8.
PLDI-2013-KongVSFPS #code generation- When polyhedral transformations meet SIMD code generation (MK, RV, KS, FF, LNP, PS), pp. 127–138.
POPL-2013-UpadrastaC #scheduling #using- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (RU, AC), pp. 483–496.
CC-2013-BhaskaracharyaB #data flow #framework #named #visual notation- PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language (SGB, UB), pp. 123–143.
PPoPP-2013-YukiFRS #analysis #array #data flow #source code- Array dataflow analysis for polyhedral X10 programs (TY, PF, SVR, VS), pp. 23–34.
SAS-2012-HoweK #analysis #parametricity #using- Polyhedral Analysis Using Parametric Objectives (JMH, AK), pp. 41–57.
STOC-2012-GoelML- Polyhedral clinching auctions and the adwords polytope (GG, VSM, RPL), pp. 107–122.
PPoPP-2012-JimboreanCPML #adaptation #framework #parallel #performance- Adapting the polyhedral model as a framework for efficient speculative parallelization (AJ, PC, BP, LM, VL), pp. 295–296.
DAC-2011-ZhaiNS #adaptation #modelling #network #process #streaming- Modeling adaptive streaming applications with parameterized polyhedral process networks (JTZ, HN, TS), pp. 116–121.
ESOP-2011-ColonS- Generalizing the Template Polyhedral Domain (MC, SS), pp. 176–195.
CGO-2011-ParkPCCS #modelling #optimisation #predict- Predictive modeling in a polyhedral optimization space (EP, LNP, JC, AC, PS), pp. 119–129.
DATE-2010-MeijerNS #modelling #network #process #throughput- Throughput modeling to evaluate process merging transformations in polyhedral process networks (SM, HN, TS), pp. 747–752.
CC-2010-BenabderrahmanePCB- The Polyhedral Model Is More Widely Applicable Than You Think (MWB, LNP, AC, CB), pp. 283–303.
ICML-2009-MartinsSX #approximate #natural language #parsing- Polyhedral outer approximations with application to natural language parsing (AFTM, NAS, EPX), pp. 713–720.
PLDI-2008-BondhugulaHRS #automation #locality- A practical automatic polyhedral parallelizer and locality optimizer (UB, AH, JR, PS), pp. 101–113.
PLDI-2008-PouchetBCC #multi #optimisation- Iterative optimization in the polyhedral model: part ii, multidimensional time (LNP, CB, AC, JC), pp. 90–100.
STOC-2008-KawarabayashiM #graph #linear #morphism- Graph and map isomorphism and all polyhedral embeddings in linear time (KiK, BM), pp. 471–480.
CIKM-2008-NguyenS08a #correlation #order #query #rank- Polyhedral transformation for indexed rank order correlation queries (PN, NS), pp. 1477–1478.
ICML-2008-DundarWLSR #case study #classification #detection- Polyhedral classifier for target detection: a case study: colorectal cancer (MD, MW, SL, MS, VCR), pp. 288–295.
CC-2008-BondhugulaBKRRS #automation #locality #optimisation #parallel- Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model (UB, MMB, SK, JR, AR, PS), pp. 132–146.
CGO-2007-PouchetBCV #optimisation- Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time (LNP, CB, AC, NV), pp. 144–156.
PPoPP-2007-GuptaR- The Z-polyhedral model (GG, SVR), pp. 237–248.
CC-2006-VasilacheBC #code generation- Polyhedral Code Generation in the Real World (NV, CB, AC), pp. 185–201.
VMCAI-2006-SankaranarayananCSM #analysis #performance #relational- Efficient Strongly Relational Polyhedral Analysis (SS, MC, HBS, ZM), pp. 111–125.
SAS-2005-SimonK #analysis- Exploiting Sparsity in Polyhedral Analysis (AS, AK), pp. 336–351.
STOC-2001-IckingM #3d #bound #complexity #diagrams #distance- A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (CI, LM), pp. 316–321.
SAT-2001-Subramani #satisfiability- A polyhedral projection procedure for Q2SAT (KS), pp. 369–375.
ICPR-v1-2000-SongGH #geometry #performance- Single View Computer Vision in Polyhedral World: Geometric Inference and Performance Characterization (MS, AG, RMH), pp. 1766–1769.
SAS-1999-BessonJT #analysis- Polyhedral Analysis for Synchronous Languages (FB, TPJ, JPT), pp. 51–68.
ICPR-1996-KitamuraK #algorithm #generative #parallel #representation- A parallel algorithm for octree generation from polyhedral shape representation (YK, FK), pp. 303–309.
ICDAR-1993-Wang #analysis #comprehension #documentation #visualisation- Machine visualization, understanding and interpretation of polyhedral line-drawings in document analysis (PSPW), pp. 882–885.
CSL-1991-Hooker #logic- Logical Inference and Polyhedral Projection (JNH), pp. 184–200.
STOC-1984-SharirS #on the- On Shortest Paths in Polyhedral Spaces (MS, AS), pp. 144–153.
DAC-1982-Kalay #bound #modelling #multi #parametricity- Modeling polyhedral solids bounded by multi-curved parametric surfaces (YEK), pp. 501–507.
ICALP-1982-DobkinK #detection #performance- Fast Detection of Polyhedral Intersections (DPD, DGK), pp. 154–165.