Forschungspapier (1578)

112821.
Forschungspapier
Becchetti, L.; Clementi, A.; Natale, E.; Pasquale, F.; Trevisan, L.: Finding a Bounded-Degree Expander Inside a Dense One. (2018), 21 S.
112822.
Forschungspapier
Bernard, F.; Thunberg, J.; Goncalves, J.; Theobalt, C.: Synchronisation of Partial Multi-Matchings via Non-negative Factorisations. (2018), 18 S.
112823.
Forschungspapier
Bernard, F.; Thunberg, J.; Swoboda, P.; Theobalt, C.: Higher-order Projected Power Iterations for Scalable Multi-Matching. (2018), 10 S.
112824.
Forschungspapier
Bhattacherjee, D.; Jyothi, S. A.; Bozkurt, I. N.; Tirmazi, M.; Aqeel, W.; Aguirre, A.; Chandrasekaran, B.; Godfrey, P. B.; Laughlin, G. P.; Maggs, B. M. et al.; Singla, A.: cISP: A Speed-of-Light Internet Service Provider. (2018), 15 S.
112825.
Forschungspapier
Biega, A. J.; Gummadi, K. P.; Weikum, G.: Equity of Attention: Amortizing Individual Fairness in Rankings. (2018), 10 S.
112826.
Forschungspapier
Biega, A. J.; Gummadi, K. P.; Weikum, G.: Equity of Attention: Amortizing Individual Fairness in Rankings. (2018), 10 S.
112827.
Forschungspapier
Boosen, M.; Pater, P.; Baum, L.: PubMan JSON Template - Paper. (2018), 12 S.
112828.
Forschungspapier
Bozkurt, I. N.; Aqeel, W.; Bhattacherjee, D.; Chandrasekaran, B.; Godfrey, P. B.; Laughlin, G.; Maggs, B. M.; Singla, A.: Dissecting Latency in the Internet's Fiber Infrastructure. (2018), 15 S.
112829.
Forschungspapier
Bringmann, K.; Cabello, S.; Emmerich, M. T. M.: Maximum Volume Subset Selection for Anchored Boxes. (2018), 25 S.
112830.
Forschungspapier
Bringmann, K.; Wellnitz, P.: Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. (2018), 15 S.
112831.
Forschungspapier
Bringmann, K.; Husfeldt, T.; Magnusson, M.: Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. (2018), 18 S.
112832.
Forschungspapier
Bund, J.; Lenzen, C.; Medina, M.: Small Hazard-free Transducers. (2018), 35 S.
112833.
Forschungspapier
Bund, J.; Lenzen, C.; Medina, M.: Optimal Metastability-Containing Sorting Networks. (2018), 14 S.
112834.
Forschungspapier
Castelli Aleardi, L.; Salihoglu, S.; Singh, G.; Ovsjanikov, M.: Spectral Measures of Distortion for Change Detection in Dynamic Graphs. (2018)
112835.
Forschungspapier
Chalermsook, P.; Das, S.; Even, G.; Laekhanukit, B.; Vaz, D.: Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. (2018), 28 S.
112836.
Forschungspapier
Chalermsook, P.; Schmid, A.; Uniyal, S.: A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. (2018), 64 S.
112837.
Forschungspapier
Chen, Y.; Singla, A.; Mac Aodha, O.; Perona, P.; Yue, Y.: Understanding the Role of Adaptivity in Machine Teaching: The Case of Version Space Learners. (2018), 25 S.
112838.
Forschungspapier
Cheung, Y. K.; Cole, R.; Tao, Y.: Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism. (2018), 16 S.
112839.
Forschungspapier
Cheung, Y. K.; Cole, R.; Tao, Y.: (Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup. (2018), 48 S.
112840.
Forschungspapier
Cheung, Y. K.; Hoefer, M.; Nakhe, P.: Tracing Equilibrium in Dynamic Markets via Distributed Adaptation. (2018), 26 S.
Zur Redakteursansicht