Working Paper (50)

481.
Working Paper
Chalermsook, P.; Laekhanukit, B.; Nanongkai, D.: Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. (2014), 37 pp.
482.
Working Paper
Qu, L.; Andres, B.: Estimating Maximally Probable Constrained Relations by Mathematical Programming. (2014), 16 pages pp.
483.
Working Paper
Bertrand, P.; Lenzen, C.: The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. (2014), brief announcement appears at DISC 2014 pp.
484.
Working Paper
Abed, F.; Caragiannis, I.; Voudouris, A. A.: Near-optimal Asymmetric Binary Matrix Partitions. (2014), 15 pages pp.
485.
Working Paper
Halperin, D.; Kerber, M.; Shaharabani, D.: The Offset Filtration of Convex Objects. (2014), 30 pp.
486.
Working Paper
Goswami, M.; Grønlund, A.; Larsen, K. G.; Pagh, R.: Approximate Range Emptiness in Constant Time and Optimal Space. (2014), 11 pp.
487.
Working Paper
Dutta, K.; Prasad, A.: Combinatorics of Finite Abelian Groups and Weil Representations. (2014), 26 pages, 3 figures Revised version, to appear in Pacific Journal of Mathematics pp.
488.
Working Paper
Kerber, M.; Raghvendra, S.: Approximation and Streaming Algorithms for Projective Clustering via Random Projections. (2014), 16 pp.
489.
Working Paper
Antoniadis, A.; Huang, C.-C.; Ott, S.: A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State. (2014), 15 pp.
490.
Working Paper
Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; van Leeuwen, E. J.: Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. (2014), Major update. In particular: new overview of the proofs, weighted variant of the main theorem, a lower bound for Steiner Forest pp.
491.
Working Paper
Choudhary, A.; Kerber, M.: Local Doubling Dimension of Point Sets. (2014), 13 pages pp.
492.
Working Paper
Bringmann, K.; Hermelin, D.; Mnich, M.; van Leeuwen, E. J.: Parameterized Complexity Dichotomy for Steiner Multicut. (2014), 26 pp.
493.
Working Paper
Jeż, A.: A really Simple Approximation of Smallest Grammar. (2014), 11 pp.
494.
Working Paper
Golovach, P. A.; Paulusma, D.; van Leeuwen, E. J.: Induced Disjoint Paths in Circular-Arc Graphs in Linear Time. (2014), 18 pp.
495.
Working Paper
Bringmann, K.; Sauerwald, T.; Stauffer, A.; Sun, H.: Balls into Bins via Local Search: Cover Time and Maximum Load. (2014), arXiv admin note: text overlap with arXiv:1207.2125 pp.
496.
Working Paper
Gilbert, A. C.; Li, Y.; Porat, E.; Strauss, M. J.: For-all Sparse Recovery in Near-optimal Time. (2014), 22 pp.
497.
Working Paper
Goswami, M.; Gu, X.; Pingali, V. P.; Telang, G.: Computing Teichmüller Maps between Polygons. (2014), 28 pages, 6 figures pp.
498.
Working Paper
Jurkiewicz, T.; Mehlhorn, K.; Nicholson, P.: Cache-Oblivious VAT-Algorithms. (2014), 6 pp.
499.
Working Paper
Iglesias-Ham, M.; Kerber, M.; Uhler, C.: Sphere Packing with Limited Overlap. (2014), 12 pages, 3 figures, submitted to SOCG 2014 pp.
500.
Working Paper
Akata, Z.; Lee, H.; Schiele, B.: Zero-Shot Learning with Structured Embeddings. (2014), 10 pp.
Go to Editor View