Search

scientific purposes and must not be republished other than by the Max Planck Institute for Informatics. The scientific use includes processing the data and showing it in publications and presentations. When [...] People Detection and Tracking Multi-Cue Onboard Pedestrian Detection Pictorial Structures Revisited: People Dectection and Articulated Pose Estimation Monocular 3D Pose Estimation and Tracking by Detection [...] Research Departments Computer Vision and Machine Learning Research People Detection, Pose Estimation and Tracking Multi-view Pictorial Structures for 3D Human Pose Estimation Multi-view Pictorial Structures

Pieter %A Kolev, Pavel %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics [...] Wellnitz, Philip %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics [...] AUTHOR = {Abbasi, Fateme and Banerjee, Sandip and Byrka, Jaroslaw and Chalermsook, Parinya and Gadekar, Ameet and Khodamoradi, Kamyar and Marx, D{\'a}niel and Sharma, Roohani and Spoerhase, Joachim}, LANGUAGE

External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics [...] van Wijland, Ernest %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics [...] Anita %A Polak, Adam %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics

External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T EFX Allocations and Orientations on Bipartite [...] %A Rathi, Nidhi %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Achieving Maximin Share and EFX/EF1 Guarantees [...] Conference Proceedings %A Akrami, Hannaneh %A Rathi, Nidhi %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Epistemic

is NP-hard and the branch-and-bound algorithm is too slow in practice, we propose an efficient local search algorithm for inference into resulting problems. We demonstrate versatility and effectiveness [...] homography and motion estimation, motion segmentation. 46 Article D2 D. Stutz, N. Chandramoorthy, M. Hein, and B. Schiele “Random and Adversarial Bit Error Robustness: Energy-Efficient and Secure DNN [...] Vision and Pattern Recognition (CVPR 2023), Vancouver, Canada, 2023. 2 Conference paper D2 A. Chaudhuri, M. Mancini, Z. Akata, and A. Dutta “Transitivity Recovering Decompositions: Interpretable and Robust

insights and model advancements in the field of weakly supervised segmentation. In addition to providing datasets and algorithm, we evaluate state-of-the-art segmentation models on our datasets and show that [...] experiments and metrics, and preserve structures well across all scales. Compared to existing work, our approach also has a simple formulation, facilitating future theoretical analysis and algorithmic improvements [...] B-cosification to a pretrained CLIP model, and show that, even with limited data and compute cost, we obtain a B-cosified version that is highly interpretable and competitive on zero shot performance across

Krzysztof and Djeacoumar, Adarsh and Javanmardi, Alireza and Seidel, Hans-Peter and Theobalt, Christian and Cordonnier, Guillaume and Myszkowski, Karol and Drettakis, George and Pan, Xingang and Leimk{\"u}hler [...] Depth of Field}, AUTHOR = {Wang, Chao and Wolski, Krzysztof and Kerbl, Bernhard and Serrano, Ana and Bemana, Mojtaba and Seidel, Hans-Peter and Myszkowski, Karol and Leimk{\"u}hler, Thomas}, LANGUAGE = {eng} [...] through Spatial and Temporal Cross-Modal Misalignments}, AUTHOR = {Jim{\'e}nez Navarro, Daniel and Peng, Xi and Zhang, Yunxiang and Myszkowski, Karol and Seidel, Hans-Peter and Sun, Qi and Serrano, Ana}

Hajira and Omeliyanenko, Janna and Zhang, Wen and Lissandrini, Matteo and Biswas, Russa and de Melo, Gerard and Bonifati, Angela and Vakaj, Edlira and Dragoni, Mauro and Graux, Damien}, LANGUAGE = {eng} [...] (ECIR 2023)}, EDITOR = {Kamps, Jaap and Goeuriot, Lorraine and Crestani, Fabio and Maistro, Maria and Joho, Hideao and Davis, Brian and Gurrin, Cathal and Kruschwitz, Udo and Caputo, Annalina}, PAGES = {359--366} [...] Language Models and Knowledge Graphs: Opportunities and Challenges}, AUTHOR = {Pan, Jeff Z. and Razniewski, Simon and Kalo, Jan-Christoph and Singhania, Sneha and Chen, Jiaoyan and Dietze, Stefan and Jabeen, Hajira

navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases and Information

MG-FSM is multiple orders of magnitude faster than baseline algorithms for general gap-constrained FSM and is competitive to state-of-the-art algorithms for n-gram mining. For more information, please refer [...] Research Departments Databases and Information Systems Software MG-FSM MG-FSM: Large-Scale Frequent Sequence Mining MG-FSM is a scalable, distributed (i.e., shared nothing) algorithm for frequent sequence mining [...] MapReduce. The algorithm can handle so-called "gap constraints", which can be used to limit the output to a controlled set of frequent sequences. At a high-level, MG-FSM carefully partitions and rewrites the