Search

We found 430 hits for your search of '3d'.
  1. Publications

    /departments/automation-of-logic/software/spass-workbench/classic-spass-theorem-prover/publications

    Publications Publications related to SPASS Weidenbach C., Dimova D., Fietzke A., Kumar R., Suda M. and Wischnewski P., 2009, SPASS Version 3.5. in 22nd International Conference on Automated Deduction, CADE

  2. Kinohelden werden bald einfacher und noch realistischer in virtuelle Welten versetzt

    /news/press-release-articles/2013/kinohelden-werden-bald-einfacher-und-noch-realistischer-in-virtuelle-welten-versetzt

    normale Videokameras sind notwendig. Mit Hilfe ihrer Software erstellen die Informatiker dann ein 3-D-Modell des zu erfassenden Darstellers aus einem Bewegungsskelett mit 58 Gelenken. Um die Bewegungen [...] Rechenverfahren kontinuierlich daraufhin, dass sich das zweidimensionale Bild aus der Videokamera und das 3-D-Modell möglichst passgenau überlagern. Die dazu notwendigen Vergleiche können die Saarbrücker auf

  3. Visual Turing Challenge

    /departments/computer-vision-and-machine-learning/research/vision-and-language/visual-turing-challenge

    (412 occurrences) the 3rd most frequent answer object: lamp (350 occurrences) the most frequent answer number: 2 (554 occurrences) the 2nd most frequent answer number: 3 (327) the 3rd most frequent answer [...] paper. Berkeley LRCN In the experiments I use dev branch with the hashtag: 716262a87f16093af6a76afc3b176d15a963147c Data that contain DAQUAR dataset converted into HDF5 format (data/daquar/h5_data/) Snapshot [...] we also explore different ways of benchmarking the machines on this complex and ambiguous task. In [3] and [4], we provide a wider view on question answering based on images task. We enumerate the challenges

  4. AMIE

    /departments/databases-and-information-systems/research/yago-naga/amie

    YAGO2 948048 Default 28.19s Sorted by: Std. Conf , PCA Conf , All rules YAGO2 948048 Support 2 facts 3.76 min All rules YAGO2 sample 46654 Support 2 facts 2.90s Sorted by PCA conf , All rules YAGO2 948048 [...] All rules YAGO2s 4122426 Default 59.38 min Rules DBpedia 2.0 6704524 Default 46.88 min Rules DBpedia 3.8 11024066 Default 7h 6 min Rules Wikidata (Dec 2014) 11296834 Default 25.50 min Rules Knowledge bases [...] For this reason, we built a sample of this KB by randomly picking 10K entities and collecting their 3 hops subgraphs. In contrast to a random sample of facts, this method preserves the original graph topology

  5. Marek Sokolowski

    /departments/algorithms-complexity/people/current-members/marek-sokolowski

    Ph. D. student at the University of Warsaw, Faculty of Informatics, Mathematics, and Mechanics Dissertation title: Efficient Data Structures and Graph Width Parameters (compiles papers: [1] [2] [3] [4]

  6. Movie heroes are soon to be transferred to virtual worlds more easily and realistically

    /news/press-release-articles/2013/movie-heroes-are-soon-to-be-transferred-to-virtual-worlds-more-easily-and-realistically

    twelve ordinary video cameras are needed. The computer scientists use their software to produce a 3-D model of the depicted person from a skeleton with 58 joints. In order to capture the movements, the [...] n method continuously works on overlaying the two-dimensional image from the video camera and the 3-D model as exactly as possible. The researchers can solve the necessary equations for this task efficiently

  7. Yiting Xia

    /departments/rg2/people/yiting-xia

    Optical Data Center Networks : %G eng %U http://hdl.handle.net/21.11116/0000-0010-43D5-2 %U https://arxiv.org/abs/2410.17012 %D 2024 %X Optical data center networks (DCNs) are renovating the infrastructure [...] 3542647 %D 2023 %B 6th Asia-Pacific Workshop on Networking %Z date of event: 2022-07-01 - 2022-07-02 %C Fuzhou, China %B 6th Asia-Pacific Workshop on Networking %P 63 - 69 %I ACM %@ 978-1-4503-9748-3 %U h [...] Training with Echelon Formation : %G eng %U http://hdl.handle.net/21.11116/0000-000C-1822-3 %R 10.1145/3563766.3564096 %D 2022 %B 21st ACM Workshop on Hot Topics in Networks %Z date of event: 2022-11-14 - 2022-11-15

  8. Reading Group Algorithms

    /departments/algorithms-complexity/teaching/summer17/reading-group

    Efficiency in Games with Dynamic Population [Apr26] May, 3 Gorav Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds [May3] May, 10 Karl Streaming algorithms for embedding and computing [...] for theoretical computer science. The target audience of this reading group are master students, PhD students, as well as postdocs. Description We will read (more or less) recent papers in theoretical [...] and Efficiency in Games with Dynamic Population Thodoris Lykouris, Vasilis Syrgkanis, Éva Tardos [May3] Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds Michael A. Forbes, Amir

  9. Graph Algorithms

    /departments/algorithms-complexity/research/graph-algorithms

    Nongkai, PhD Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 – Room 301 66123 Saarbrücken more Contact danupon@mpi-inf.mpg.de +49 681 9325 1000 +49 681 9325 1099 Departments D1 Researchers [...] Prof. Dr. Karl Bringmann Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 3 – Room 4.14 66123 Saarbrücken more Contact kbringma@mpi-inf.mpg.de +49 681 302 4447 +49 681 302 1099 [...] 66123 Saarbrücken more Contact yjiang@mpi-inf.mpg.de +49 681 9325 1115 +49 681 9325 1099 Departments D1, IMPRS Zihang Wu Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 – Room

  10. Reading Group Algorithms: Continuous Methods for Combinatorial Problems

    /departments/algorithms-complexity/teaching/winter21/reading-group

    present the introductory chapters of the book (Chapter 2,3,4) in the first few weeks of the course. Every lecture of the subsequent week will consist of 2-3 student presentations. Each week (after the introductory [...] new chapter of the book every week. The target audience of this reading group are master students, PhD students, as well as postdocs. You can subscribe to the mailing list here: https://lists.mpi-inf.mpg [...] expected to prepare roughly one chapter of the book. The contents of the chapter would be divided into 2-3 logical parts, each forming one individual presentation. The decision on who presents in the coming