- Out-of-Core Terrain Rendering with Reparameterized Joachim Harabasz
- Figure 2: Data Preparation Dialog 1.2 Data Preparation
- M E N S C H E N 45forsch 1/2011 universittbonn
- PERMANENT GENETIC RESOURCES NOTE 871 Franken RJ, Hik DS (2004) Influence of habitat quality, patch size,
- Bare-Handed 3D Interaction For interaction with a virtual environment, tracking bare hands is one of the favorite
- C o m p u t e r G r a p h i c s T e c h n i c a l R e p o r t s Improving the Aesthetic Quality of
- Markerless 6+4DOF real-time visual tracking of the human hand with automatic initialization
- A reflectometer setup for spectral BTF measurement Daniel Lyssi
- THE MATCHING PROBLEM FOR BIPARTITE GRAPHS WITH POLYNOMIALLY BOUNDED PERMANENTS IS IN NC
- Distances in the Homology Curve Complex Ingrid Irmer
- Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
- Eurographics Symposium on Rendering 2009 Hendrik P. A. Lensch and Peter-Pike Sloan
- Object-Class Segmentation using Deep Convolutional Neural Networks
- Eurographics Symposium on Rendering 2010 Jason Lawrence and Marc Stamminger
- Eurographics/ ACM SIGGRAPH Symposium on Computer Animation (2011) Posters and Demos Filling Long-Time Gaps of Motion Capture Data
- FRAUNHOFER-INSTITUT FR KOMMUNIKATION, INFORMATIONSVERARBEITUNG UND ERGONOMIE FKIE MMX, SSE{1,2,3}, VMX
- C O M P U T E R G R A P H I C S T E C H N I C A L R E P O R T S Efficient Retrieval of 3D Building Models Using Embeddings of Attributed
- Multi-Instance Methods for Partially Supervised Image Segmentation
- Time-Varying BTFs Tobias Langenbucher, Sebastian Merzbach, David Moller,
- Real-Time Plane Segmentation using RGB-D Cameras
- Real-Time Plane Segmentation using RGB-D Cameras
- Real-Time Trajectory Generation by Offline Footstep Planning for a Humanoid Soccer Robot
- A CURVE COMPLEX AND INCOMPRESSIBLE SURFACES IN S R
- EUROGRAPHICS 2009 / P. Dutr and M. Stamminger (Guest Editors)
- Motion Reconstruction Using Sparse Accelerometer Data JOCHEN TAUTGES
- Learning Visual Obstacle Detection Using Color Histogram Features
- Local Multiresolution Path Planning in Soccer Games Based on Projected Intentions
- Efficient Multi-Resolution Plane Segmentation of 3D Point Clouds
- Eurographics Symposium on Parallel Graphics and Visualization (2009) J. Comba, K. Debattista, and D. Weiskopf (Editors)
- Compliant Task-Space Control with Back-Drivable Servo Actuators
- GEOMETRY OF THE HOMOLOGY CURVE COMPLEX INGRID IRMER
- A Multi-Camera, Multi-Projector Super-Resolution Framework for Structured Light
- Exploration Strategies for Building Compact Maps in Unbounded Environments
- The Fully Compressed String Matching for LempelZiv Encoding
- Subclasses of Quantified Boolean Formulas Andreas Flogel
- A Lower Bound for Integer Multiplication on Randomized ReadOnce Branching Programs
- Polynomial Time Approximation Schemes for Dense Instances of NPHard Problems
- On Approximation Hardness of the Bandwidth Problem
- ESPRIT BR Working Group --7097 (RAND) Final Report
- Ultrafast Randomized Parallel Construction and Approximation
- Improved Approximation Lower Bounds on Small Occurrence Optimization
- A Note on Online Load Balancing for Related Machines
- On the Approximability of Dense Steiner Problems
- Zero Testing of padic and Modular Polynomials
- Improved Lower Bounds for the Shortest Superstring and Related Problems
- ON THE COMPUTATIONAL HARDNESS OF TESTING SQUAREFREENESS OF SPARSE
- Optimal PrefixFree Codes for Unequal Letter Costs
- Randomized Splay Trees: Theoretical and Experimental Results
- Approximating Bounded Degree Instances of NPHard Problems \Lambda
- Randomized\Omega (n ) Lower Bound for
- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications #
- Approximate Counting of Given Length Cycles Carsten Dorgerloh x Jurgen Wirtgen --
- On the Sequential and Parallel Complexity of Matching in
- Greibach Normal Form Transformation, Robert Koch
- Approximating Transitivity in Directed Networks Piotr Berman #
- An (ffl,ffi)Approximation Algorithm of the Number of Zeros of a Multilinear Polynomial over GF[q]
- Lower Bounds on Complexity of Testing Membership to a Polygon
- November 8, 2010 16:45 WSPC/INSTRUCTION FILE S0129054110007635
- NPHardness of the Bandwidth Problem on Dense Graphs
- Algorithms for Construction of Optimal and Almost-Optimal
- ReadOnce Threshold Formulas, Justifying Assignments, and Generic Transformations
- Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
- Polynomial time algorithms for modules over finite dimensional algebras
- An Exponential Lower Bound for Depth 3 Arithmetic Circuits
- NPHardness of the Bandwidth Problem on Dense Graphs
- Correctness of Constructing Optimal Alphabetic Trees Revisited
- Computational Complexity of Sparse Real Algebraic Function Interpolation
- On the Computational Complexity of Quantified Horn Clauses
- Lower Bound for Randomized Linear Decision Tree Recognizing a
- Decoding of Canonical Huffman Codes with LookUp Tables
- The Computational Complexity of (XOR;AND)Counting Problems
- Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks
- 9/8-Approximation Algorithm for Random MAX-3SAT
- Trading GRH for Algebra: Algorithms for Factoring Polynomials and Related Structures
- New Approximation Algorithms for the Steiner Trees Problems Marek Karpinski \Lambda Alexander Zelikovsky y
- Metric Construction, Stopping Times and Path Coupling
- Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees
- Approximation Schemes for Metric Minimum Bisection and Partitioning
- Approximating Transitive Reductions for Directed Networks
- On the Sample Complexity of W. Fernandez de la Vega # Marek Karpinski +
- 1.0957-Approximation Algorithm for Random MAX-3SAT
- A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
- Approximation Algorithms for Bandwidth Problems on some large Graph Classes
- Computational Complexity of Sparse Rational Interpolation 1
- An Efficient Parallel Algorithm for the 3MIS Problem 1
- An Algorithm to Learn ReadOnce Threshold Formulas, and some Generic Transformations between Learning Models
- Wavelet Based Erasure-Resilient Video Transmission System
- On the Complexity of Genuinely Polynomial Computation
- Approximation of Global MAXCSP W. Fernandez de la Vega # Ravi Kannan +
- ESPRIT BR Project RANDREC ( ECUS Exploratory Collaborative Activity --
- oMinimal Expansions of the Real Field
- ESPRIT BR Working Group --7097 (RAND) Annual Progress Report
- A New Measure of the Distance between Ordered Trees
- Once again: Finding simple cycles in graphs Carsten Dorgerloh x Jurgen Wirtgen --
- Complexity of Computing Functions by Quantum Branching Programs
- On a New High Dimensional WeisfeilerLehman Sergei Evdokimov \Lambda Marek Karpinski y Ilia Ponomarenko z
- An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
- An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF [q]
- E#cient Parallel Computation of Nearest Neighbor Interchange Distances
- An Ecient Data Structure for Searching Strings
- Parallel RealTime Videotransmission over Lossy Christoph Gunzel \Lambda Falko Riemenschneider y Jurgen Wirtgen z
- Approximation of the Permanent for Graphs of Density Less than 1/2 is hard
- On the coordination ratio of load balancing Matthias Kretschmer
- TSP with Bounded Metrics Lars Engebretsen Marek Karpinski
- A Polynomial Time Approximation Scheme for Subdense MAX-CUT
- Approximation Hardness of Short Symmetric Instances of MAX-3SAT
- On Some Tighter Inapproximability Piotr Berman \Lambda Marek Karpinski y
- A Factor 3/2 Approximation for Generalized Steiner Tree Problem with
- Almost Optimal Sublinear Time Parallel Recognition Algorithms
- On Approximation Lower Bounds for TSP with Bounded Metrics
- FAST PARALLEL DECOMPOSITION BY CLIQUE SEPARATORS
- Polynomial Time Approximation Schemes for Dense Instances of the Minimum Constraint Satisfaction
- Approximability of Vertex Cover in Dense Bipartite Hypergraphs
- On Primitive Cellular Algebras Sergei Evdokimov \Lambda Ilia Ponomarenko y
- On Efficient Decoding of Huffman Codes Yakov Nekritch \Lambda
- Randomized Complexity of Linear Arrangements and Polyhedra
- Byteoriented Decoding of Canonical Huffman Yakov Nekritch \Lambda
- The nni-distance is a well-known distance measure for phylogenetic trees. We con-struct an e cient parrallel approximation algorithm (in the CRCW-PRAM model)
- ESPRIT BR Project RANDREC ( ECUS Exploratory Collaborative Activity --
- Approximate Counting of Matchings in Sparse Hypergraphs
- On the Power of Randomized Ordered Branching Programs \Lambda
- Polynomial Time Approximation Schemes for Metric MIN-BISECTION
- On randomized algebraic test complexity \Lambda Peter Burgisser y
- Low-Memory Adaptive Pre x Coding Travis Gagie Marek Karpinski y Yakov Nekrich y
- Some Tools for Modeling and Analysis of Surfaces Carsten Dorgerloh \Lambda
- Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks
- ESPRIT BR Project RANDREC ( ECUS Exploratory Collaborative Activity --
- On the Complexity of Global Constraint Satisfaction
- A ZeroTest and an Interpolation Algorithm for the Shifted Sparse Polynomials
- ESPRIT BR Project RANDREC ( ECUS Exploratory Collaborative Activity --
- Parallel Subquadratic Work Algorithms for Constructing Approximately
- Alphabet--Independent Optimal Parallel Search for Three Dimensional Patterns
- A note on improving the running time of a class of parallel algorithms using randomization
- The Measure Hypothesis and E#ciency of Polynomial Time Approximation Schemes
- Maximum Matching in General Graphs Without Explicit Consideration of Blossoms
- A FAST PARALLEL ALGORITHM FOR COMPUTING ALL MAXIMAL CLIQUES IN A GRAPH AND THE RELATED PROBLEMS
- A PolynomialTime Subpolynom Approximation Scheme for the
- Fast Data Structures for Orthogonal Range Reporting
- !#"$"&%('*),+.- /1 0(+2 '43 56/4%(7&3$ 8:9; 9=<>'?%@0(A&8C BED4 FHG IKJL/49;8 M NPORQTS$U: VX W; Y OZW\[ZQ]W;U 1,# N(U ^#_`NPORWba@ c N(OZd eHU Q a:e 2,##
- On Approximation Complexity of Edge Dominating Set Problem
- Fast Interpolation Algorithms for Sparse Polynomials with Respect
- Algorithms for Interpolation of Sparse Rational Functions Using
- The Parallel and Sequential Complexity of Matching on Chordal and Strongly Chordal
- A Generalization of Wilkie's Theorem of the Complement,
- Approximating Volumes and Integrals in oMinimal and pMinimal Theories
- Computational Complexity of Learning ReadOnce Formulas over Different Bases
- ESPRIT Working Group: 21726 Randomized Algorithms (RAND2)
- Finding one of many Disjoint Perfect Matchings in a Bipartite Graph
- Cycles and Paths in EdgeColored Graphs with Given Degrees A. Abouelaoualim # K. Ch. Das + W. Fernandez de la Vega # M. Karpinski
- Lower Space Bounds for Randomized Computation
- Optimal Bounds for Testing Sparse Polynomials over F 3 Kai Werther \Lambda
- On LR(k)parsers of polynomial size Norbert Blum
- Approximation Hardness of TSP with Bounded Metrics (Revised Version)
- A Lower Bound for Randomized Algebraic Decision Trees
- Dynamic Planar Orthogonal Range Marek Karpinski Yakov Nekrich y
- Approximability of Hypergraph Minimum Bisection
- Scaled Dimension and the BermanHartmanis Conjecture
- Approximating Dense Cases of Covering Marek Karpinski \Lambda Alexander Zelikovsky y
- A Conjecture about Homogeneous and Antisymmetric mSchemes
- Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication
- On Randomized Versus Deterministic Computation Marek Karpinski \Lambda
- Boolean Circuit Complexity of Algebraic Interpolation Problems
- Probabilistic Recurrence Relations for Parallel DivideandConquer Algorithms \Lambda
- An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3
- Computation of the Additive Complexity of Algebraic Circuits with Root Extracting
- Approximation Complexity of Nondense Instances of MAXCUT
- Alphabet Independent Optimal Parallel Search for ThreeDimensional Patterns
- 8/7Approximation Algorithm for (1,2)TSP # (Extended Version)
- Polynomial--Time Computation of the Degree of Algebraic Varieties
- Polynomial Time Approximation Schemes for Dense and Geometric k-Restricted
- Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents \Lambda
- Robust RealTime Videotransmission over Lossy Christoph Gunzel \Lambda Falko Riemenschneider y
- Approximability of Selected Phylogenetic Tree Problems
- Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem
- Improved Approximations for General Minimum Cost Scheduling
- A Fast Randomized Parallel Algorithm for Finding Simple Cycles in Planar Graphs
- On Approximation Complexity of Metric Dimension Problem
- An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO)
- Tight Approximation Bounds for Vertex Cover on Dense kPartite Hypergraphs
- Fast Parallel Algorithms for the Clique Separator Decomposition
- On the Computation Power of Randomized Branching Programs
- Polynomial Time Decomposition of Modules over Algebras and its Application
- The Complexity of TwoDimensional Compressed PatternMatching
- 8/7Approximation Algorithm for Piotr Berman # Marek Karpinski +
- Randomized Navigation to a Wall through Convex Piotr Berman \Lambda Marek Karpinski y
- On Approximability of Minimum Bisection and Related Partition
- On a Sublinear Time Parallel Construction of Optimal Binary Search Trees
- Correctness of Constructing Optimal Alphabetic Trees Revisited
- Lower Bounds for the Number of Zeros of Multivariate Polynomials over GF [q]
- A Resolution Method for Quantified Boolean Formulas
- Approximation Schemes for the Betweenness Problem in Tournaments
- Approximability of the Minimum Bisection Problem: An Algorithmic
- An Improved Pattern-Matching Algorithm for Strings with Short Descriptions
- Approximation Hardness and Satis ability of Bounded Occurrence Instances of SAT
- A Simplified Realization of the HopcroftKarp Approach to Maximum Matching in General
- Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis
- Efficient Amplifiers and Bounded Degree Optimization
- On Approximation Intractability of the Bandwidth Problem
- Polynomial--Time Computation of the Dimension of Affine Algebraic Varieties in Zero--Characteristic
- Randomization and the Computational Power of Analytic and Algebraic
- Approximation Hardness of the (1; 2)-Steiner Tree Problem
- A Lower Bound on the Size of Algebraic Decision Trees for the MAX Problem
- Predecessor Queries in Constant Time? ? Marek Karpinski a;1 Yakov Nekrich a;2
- Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint
- A New Algorithm for the Ordered Tree Inclusion Problem \Lambda
- Trading Tensors for Cloning: Constant Time Approximation Schemes
- A Polynomial Time Approximation Scheme for MAXBISECTION on Planar Graphs
- Some Separation Problems on Randomized OBDDs
- Simulating Threshold Circuits by Majority Circuits Mikael Goldmann \Lambda
- Polynomial Time Approximability of Dense Weighted Instances of MAXCUT
- The Mixing Rate of Glauber Dynamics for Sampling Colourings of
- Range Reporting for Moving Points on a Grid Marek Karpinski 1 , J. Ian Munro 2 , and Yakov Nekrich 1
- An Interpolation Algorithm for Sparse Polynomials over Zm Kai Werther \Lambda
- A Note on Las Vegas OBDDs Marek Karpinski \Lambda Rustam Mubarakzjanov y
- Approximating Optimal Binary Trees in Piotr Berman \Lambda Marek Karpinski y Yakov Nekrich z
- TSP with Bounded Metrics: Stronger Approximation Hardness
- On Stability of Banking Networks Piotr Berman # Bhaskar DasGupta + Lakshmi Kaligounder # Marek Karpinski
- Compact Cellular Algebras and Permutation Groups Sergei Evdokimov \Lambda Marek Karpinski y Ilia Ponomarenko z
- 1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
- Lower Bounds on Testing Membership to a Polyhedron
- Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees
- Approximation Schemes for Clustering Problems in Finite Metrics and High Dimensional Spaces
- Algorithms for Sparse Rational Interpolation Dima Yu. Grigoriev \Lambda
- THE MATCHING PROBLEM FOR BIPARTITE GRAPHS WITH POLYNOMIALLY BOUNDED PERMANENTS IS IN NC
- Parallel Construction of the Minimum Redundancy LengthLimited Codes
- Polynomial Time Approximation Schemes for Some Dense Instances of
- Perfect Matching for Regular Graphs is AC 0 Hard for the General Matching Problem
- Twoclosure of odd permutation group in polynomial time
- Deterministic Polynomial Time Algorithms for Matrix Completion Problems
- Space Ecient Dynamic Orthogonal Range Yakov Nekrich
- Polynomial--Time Computation of the Dimension of Algebraic Varieties in Zero--Characteristic
- Robust RealTime Audiotransmission over Lossy Christoph Gunzel \Lambda
- VC Dimension and Learnability of Sparse Polynomials
- Strong Version of the Basic Deciding Algorithm for the Existential Theory of Real Fields
- Quantum Finite Multitape Automata Andris Ambainis (Berkeley) \Lambda
- A Note on Traversing Skew Merkle Marek Karpinski Yakov Nekrich y
- ESPRIT BR Working Group --7097 (RAND) Annual Progress Report
- Approximating Huffman Codes in Parallel (Revised Version)
- Linear Time Approximation Schemes for the GaleBerlekamp Game and Related Minimization Problems
- Polynomial Time Approximation Schemes for Some Dense Instances of
- Trading Tensors for Cloning: Constant Time Approximation Schemes
- There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a TwoWay
- RESEARCH REPORT Department of computer science
- Approximating Volumes and Integrals Via the VC Dimension
- Polynomial Time Approximation Schemes for Dense Instances of
- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems #
- A Simple LinearTime Algorithm to Find the Contour in a Coloured Triangular Graph
- Complexity of Deciding Solvability of Polynomial Equations over padic Integers
- Algorithms for Sparse Rational Interpolation Dima Yu. Grigoriev
- Key Distribution Kathrin Sayk
- Approximation Hardness of TSP with Bounded Metrics Lars Engebretsen? Marek Karpinski??
- Approximability of Vertex Cover in Dense Bipartite Hypergraphs
- Excerpt from the Examination Rules for the Master Degree Course in Computer Science (January 2012; inofficial translation)
- Fast Interpolation Algorithms for Sparse Polynomials with Respect
- On the Complexity of Global Constraint Satisfaction
- Approximating Volumes and Integrals in o-Minimal and p-Minimal Theories
- Tensor Decomposition and Approximation Schemes for Constraint Satisfaction Problems
- A Fast Randomized Parallel Algorithm for Finding Simple Cycles in Planar Graphs
- Polynomial{Time Computation of the Dimension of Algebraic Varieties in Zero{Characteristic
- The Mixing Time of Glauber Dynamics for Colouring Regular Trees
- THE MATCHING PROBLEM FOR BIPARTITE GRAPHS WITH POLYNOMIALLY BOUNDED PERMANENTS IS IN NC
- Lower Space Bounds for Randomized Computation
- On Approximation Lower Bounds for TSP with Bounded Metrics
- Fast Parallel Algorithms for the Clique Separator Decomposition
- On randomized algebraic test complexity Peter Burgissery
- Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems
- On the Power of Randomized Ordered Branching Farid Ablayev y
- Two-closure of odd permutation group in polynomial time
- Schemes for Deterministic Polynomial Factoring Gabor Ivanyos
- Parallel Construction of the Minimum Redundancy Length-Limited Codes
- On Primitive Cellular Algebras Sergei Evdokimov Ilia Ponomarenko y
- Approximability of the Minimum Bisection Problem: An Algorithmic
- On-line Load Balancing for Related Machines 1 Piotr Berman
- Scaled Dimension and the Berman-Hartmanis Conjecture
- Approximating Optimal Binary Trees in Piotr Berman Marek Karpinskiy Yakov Nekrichz
- Veranstaltungskalender Bonner Mathematik
- An Algorithm to Learn Read-Once Threshold Formulas, and some Generic Transformations between Learning Models
- Approximating Vertex Cover in Dense Hypergraphs
- Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks
- Improved Approximations for General Minimum Cost Scheduling
- Ideas for Connecting Inductive Program Synthesis and Bidirectionalization
- The Complexity of Two-Dimensional Compressed Pattern-Matching
- Anleitung zum Scannen Um auf dem Rechner "moika" (Foyer der Bibliothek) scannen zu knnen, gibt
- Fr Studenten der Physik, Chemie oder (Angewandten) Mathematik, ist am Institut fr Numerische Simulation (http://www.ins.uni-bonn.de/) ab sofort eine
- Polynomial Time Approximation Schemes for Dense Instances of the Minimum Constraint Satisfaction
- GEOMETRY OF THE HOMOLOGY CURVE COMPLEX INGRID IRMER
- Diplomarbeit Theory of m-Schemes and Applications to
- Correctness of Constructing Optimal Alphabetic Trees Revisited
- Strong Version of the Basic Deciding Algorithm for the Existential Theory of Real Fields
- An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF q]
- Read-Once Threshold Formulas, Justifying Assignments, and Generic Transformations
- Once again: Finding simple cycles in graphs Carsten Dorgerloh
- On Approximation Hardness of the Bandwidth Problem
- Approximation of Global MAX-CSP W. Fernandez de la Vega
- Computational Complexity of Learning Read-Once Formulas over Di erent Bases
- A Resolution Method for Quanti ed Boolean Formulas
- NP-Hardness of the Bandwidth Problem on Dense Graphs
- Approximating Bounded Degree Instances of NP-Hard Problems
- An E cient Parallel Algorithm for the Minimal Elimination Ordering (MEO)
- On the Sample Complexity of W. Fernandez de la Vega
- Optimal Pre x-Free Codes for Unequal Letter Costs
- ESPRIT BR Project RAND-REC ( EC-US Exploratory Collaborative Activity {
- Polynomial Time Approximability of Dense Weighted Instances of MAX-CUT
- Some Tools for Modeling and Analysis of Surfaces Carsten Dorgerloh
- Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
- Lower Bound for Randomized Linear Decision Tree Recognizing a
- Page 1 of 4 LOCAL RECRUITMENT
- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
- Why is an IEEE Student Branch Beneficial? A Student Branch gives students the opportunity to meet and learn from fellow students, as well as faculty members and
- Schwerpunkt Genetische Medizin und Genetische Epidemiologie -Bonn Die Identifizierung und Charakterisierung der genetischen Ursachen von Krankheiten sind
- On Some Tighter Inapproximability Piotr Berman Marek Karpinskiy
- Lower Bounds for the Number of Zeros of Multivariate Polynomials over GF q]
- Robust Real-Time Videotransmission over Lossy Christoph Gunzel Falko Riemenschneidery
- Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks
- Decoding of Canonical Hu man Codes with Look-Up Tables
- Information for master and diploma students interested in doing field research in West Africa
- Space-Efficient Multi-Dimensional Range Marek Karpinski and Yakov Nekrich
- On the Sequential and Parallel Complexity of Matching in
- INTERNATIONALES KONVERSIONSZENTRUM BONN -Pfarrer-Byns-Strae 1 BONN INTERNATIONAL CENTER FOR CONVERSION (BICC) GMBH 53121 Bonn
- Max-Planck-Institut zur Erforschung von Gemeinschaftsgtern
- On Approximation Complexity of Edge Dominating Set Problem
- Approximation Complexity of Nondense Instances of MAX-CUT
- A Note on On-line Load Balancing for Related Machines
- ESPRIT Working Group: 21726 Randomized Algorithms (RAND2)
- Herz-Kreislauferkrankungen Wie hoch ist mein Risiko?
- Approximation of the Permanent for Graphs of Density Less than 1/2 is hard
- On Approximation Intractability of the Bandwidth Problem
- 1.375-Approximation Algorithm for Sorting by Reversals
- Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms
- Approximate Counting of Matchings in Sparse Hypergraphs
- Finding and Extracting Crypto Routines from Malware Felix Leder, Peter Martini, Andre Wichmann
- Data-Driven Texturing of Human Motions Bjrn Krger1, Arno Zinke2, Jan Baumann3, Andreas Weber1
- INTERNATIONALES KONVERSIONSZENTRUM BONN -Pfarrer-Byns-Strae 1 BONN INTERNATIONAL CENTER FOR CONVERSION (BICC) GMBH 53121 Bonn
- Approximation Algorithms for MAX-BISECTION on Low Degree Regular
- An ( , )-Approximation Algorithm of the Number of Zeros of a Multilinear Polynomial over GF q]
- A Note on Approximating MAX-BISECTION on Regular Graphs
- On E cient Decoding of Hu man Codes Yakov Nekritch
- The Mixing Rate of Glauber Dynamics for Sampling Colourings of
- Friedrich-Wilhelms-Universitt Bonn
- Moduli Spaces Two Riemann surfaces of the same topological type can, of course, be con-
- On Bayesian Tracking and Data Fusion: A Tutorial
- LEARNING AGREEMENT -ACADEMIC YEAR 20__/20__ FIELD OF STUDY: M A T H E M A T I C S
- University of Bonn Technical Report
- Lower Bounds on Testing Membership to a Polyhedron
- A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs
- LOCAL RECRUITMENT Bonn, Germany
- Complexity of Computing Functions by Quantum Branching Programs
- Greibach Normal Form Transformation, Robert Koch
- Randomization and the Computational Power of Analytic and Algebraic
- On Stability of Banking Networks Piotr Berman Bhaskar DasGupta Lakshmi Kaligounder Marek Karpinski
- On the Complexity of Genuinely Polynomial Computation
- Perfect Matching for Regular Graphs is AC0-Hard for the General Matching Problem
- Polynomial{Time Computation of the Degree of Algebraic Varieties
- Classification and Detection of Metamorphic Malware using Value Set Analysis Felix Leder, Bastian Steinbock, Peter Martini
- NP-Hardness of the Bandwidth Problem on Dense Graphs
- Capturing Shape and Reflectance of Food Christopher Schwartz
- Polynomial time algorithms for modules over nite dimensional algebras
- Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
- The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes
- Stephan Wagner 2 Was ist das IEEE?
- 3D RECONSTRUCTION OF PLANT ROOTS FROM MRI IMAGES Hannes Schulz1
- A Note on Las Vegas OBDDs Marek Karpinski Rustam Mubarakzjanov y
- A Conjecture about Homogeneous and Antisymmetric m-Schemes
- FAST PARALLEL DECOMPOSITION BY CLIQUE SEPARATORS
- Boolean Circuit Complexity of Algebraic Interpolation Problems
- Prof. Dr. W. Muller SS 2010 Elliptische Funktionen und Modulformen
- ESPRIT BR Project RAND-REC ( EC-US Exploratory Collaborative Activity {
- Approximating Subdense Instances of Covering Problems
- An E cient Parallel Algorithm for the 3MIS Problem1
- Alphabet Independent Optimal Parallel Search for Three-Dimensional Patterns
- On a Sublinear Time Parallel Construction of Optimal Binary Search Trees
- A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynomials
- Local Multiresolution Path Planning in Soccer Games Based on Projected Intentions
- AN INVESTIGATION OF BARE-HANDS-INTERACTION IN TRADITIONAL 3D GAME GENRES
- Almost Optimal Sublinear Time Parallel Recognition Algorithms
- AStA-Sportreferent/in gesucht!!! Das autonome Sportreferat des Allgemeinen Studierendenausschusses (AStA) der Universitt Bonn
- The Quest for Uncertainty Jorg Zimmermann and Armin B. Cremers
- Intuitive Multimodal Interaction and Predictable Behavior for the Museum Tour Guide Robot Robotinho
- An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
- Exploration Strategies for Building Compact Maps in Unbounded Environments
- DEAR STUDENTS! The University Computer Center (Hochschulrechen -
- On the Computational Power of Probabilistic and Quantum Branching Programs
- Info Booklet for long-term guests
- Improving Indoor Navigation of Autonomous Robots by an Explicit Representation of Doors
- On Approximation Complexity of Metric Dimension Problem
- ESPRIT BR Working Group { 7097 (RAND) Annual Progress Report
- Nebula Generating Syntactical Network Intrusion Signatures Tillmann Werner, Christoph Fuchs, Elmar Gerhards-Padilla, Peter Martini
- Randomized Complexity of Linear Arrangements and Polyhedra
- Page 1 of 4 INTERNATIONAL RECRUITMENT
- Alphabet{Independent Optimal Parallel Search for Three Dimensional Patterns
- Computational Complexity of Sparse Rational Interpolation1
- A Lower Bound for Randomized Algebraic Decision Trees
- Complexity of Deciding Solvability of Polynomial Equations over p-adic Integers
- Multiresolution Path Planning in Dynamic Environments for the Standard Platform League
- The Fully Compressed String Matching for Lempel-Ziv Encoding
- SDMVIS Manual Max Hermann
- Stopping Times, Metrics and Approximate Counting
- Improved Lower Bounds for the Shortest Superstring and Related Problems
- Byte-oriented Decoding of Canonical Hu man Yakov Nekritch
- SFB Transregio 45 -Members in Bonn (December 2011): Bernardara, Marcello, Dr.
- On the Computation Power of Randomized Branching Programs
- Approximability of Combinatorial Optimization Problems on Power-Law
- The Institute of Crop Science and Resource Conservation, Department of Soil Science and Soil Ecology offers a PhD position within the West African Science Service Center on Climate
- Approximating Transitive Reductions for Directed Networks
- Maximum Matching in General Graphs Without Explicit Consideration of Blossoms
- Learning Visual Obstacle Detection Using Color Histogram Features
- Parallel Subquadratic Work Algorithms for Constructing Approximately
- Approximate Counting of Given Length Cycles Carsten Dorgerlohx Jurgen Wirtgen{
- An E cient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3
- Approximation Algorithms for Bandwidth Problems on some large Graph Classes
- On Approximation Lower Bounds for TSP with Bounded Metrics
- Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis
- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
- Approximating Dense Cases of Covering Marek Karpinski Alexander Zelikovskyy
- Intuitive Multimodal Interaction for Domestic Service Robots Matthias Nieuwenhuisen, Jrg Stckler, and Sven Behnke
- Polynomial Time Approximation Schemes for Some Dense Instances of
- A Generalization of Wilkie's Theorem of the Complement,
- A Polynomial-Time Subpolynom-Approximation Scheme for the
- Polynomial{Time Computation of the Dimension of A ne Algebraic Varieties in Zero{Characteristic
- A FAST PARALLEL ALGORITHM FOR COMPUTING ALL MAXIMAL CLIQUES IN A GRAPH AND THE RELATED PROBLEMS
- Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees
- Approximating Transitivity in Directed Networks Piotr Berman
- Subclasses of Quanti ed Boolean Formulas Andreas Flogel
- Algorithms for Interpolation of Sparse Rational Functions Using
- Veranstaltungskalender Bonner Mathematik
- Prof. Dr. W. Muller WS 2009/10 Partielle Differentialgleichungen und spezielle Funktionen
- Randomized Splay Trees: Theoretical and Experimental Results
- TSP with Bounded Metrics Lars Engebretsen1, and Marek Karpinski2,
- Proactive Botnet Countermeasures An Offensive Approache
- 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances
- Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
- Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents
- E cient Ampli ers and Bounded Degree Optimization
- Lower Bounds on Complexity of Testing Membership to a Polygon
- The Computational Complexity of (XOR; AND)-Counting Problems
- Deterministic Polynomial Time Algorithms for Matrix Completion Problems
- 8/7-Approximation Algorithm for (1,2)-TSP (Extended Version)
- Next Generation BotNet Protocol Analysis Felix S. Leder and Peter Martini
- EUROPEAN CREDIT TRANSFER SYSTEM LEARNING AGREEMENT
- On Randomized Versus Deterministic Computation Marek Karpinski
- ESPRIT BR Working Group { 7097 (RAND) Final Report
- Approximating Minimum Unsatis ability of Linear Equations
- Ultrafast Randomized Parallel Construction-and Approximation
- New Approximation Algorithms for the Steiner Trees Problems Marek Karpinski Alexander Zelikovskyy
- Cycles and Paths in Edge-Colored Graphs with Given Degrees A. Abouelaoualim
- Range Reporting for Moving Points on a Grid Marek Karpinski1, J. Ian Munro2, and Yakov Nekrich1
- Schwerpunkt Hepato-/Gastroenterologie -Bonn Innerhalb des Schwerpunktes Hepato-/Gastroenterologie werden folgende
- Polynomial Time Decomposition of Modules over Algebras and its Application
- G r a d u a t e r e c o r d e x a m i n a t i o n s Science Test
- Zero Testing of p-adic and Modular Polynomials
- Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint
- A New Algorithm for the Ordered Tree Inclusion Problem
- A New Measure of the Distance between Ordered Trees
- Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT
- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation
- Veranstaltungskalender Bonner Mathematik
- Efficient Parallel Computation of Nearest Neighbor Interchange Distances
- Optimal Bounds for Testing Sparse Polynomials over F3 Kai Werther
- 906 M. Karpinski, A. Rucinski & E. Szymanska 1. Introduction
- ON THE COMPUTATIONAL HARDNESS OF TESTING SQUARE-FREENESS OF SPARSE
- Page 1 of 3 INTERNATIONAL RECRUITMENT
- Parallel Real-Time Videotransmission over Lossy Christoph Gunzel Falko Riemenschneidery Jurgen Wirtgenz
- A CURVE COMPLEX AND INCOMPRESSIBLE SURFACES IN S R
- "!# $ !%&('0)21 3546487@9BADCFEGIH@CP9RQSTGR7@U8Q6VXWYWa`b9c7dH@e8VgfihRprq2sutvGRWYV
- On the Computational Complexity of Quanti ed Horn Clauses
- Randomized Navigation to a Wall through Convex Piotr Berman Marek Karpinski y
- Forschungsschwerpunkt Neurowissenschaften (Stand 02/2012) -Bonn Die Klinik fr Psychiatrie und Psychotherapie (Prof. Dr. W. Maier) verfolgt zwei wesentliche
- Trading Tensors for Cloning: Constant Time Approximation Schemes
- Diplomarbeit Sylvester-Gallai-Konfigurationen und
- Simulating Threshold Circuits by Majority Circuits Mikael Goldmann
- A Simple Linear-Time Algorithm to Find the Contour in a Coloured Triangular Graph
- Metric Construction, Stopping Times and Path Coupling
- Correctness of Constructing Optimal Alphabetic Trees Revisited
- Trading GRH for Algebra: Algorithms for Factoring Polynomials and Related Structures
- On Approximation Hardness of Dense TSP and other Path Problems
- Veranstaltungskalender Bonner Mathematik
- The Parallel and Sequential Complexity of Matching on Chordal and Strongly Chordal
- Capturing Shape and Reflectance of Food
- o-Minimal Expansions of the Real Field
- The Complexity of Perfect Matching Problems on Dense Hypergraphs
- Diplomarbeit Sylvester-Gallai Theorems and Identities over R
- 8/7-Approximation Algorithm for Piotr Berman
- VC Dimension and Learnability of Sparse Polynomials
- Improved Approximation of MAX-CUT on Graphs of Bounded Degree
- Approximability of Dense Instances of Nearest Codeword Problem
- An Interpolation Algorithm for Sparse Polynomials over Zm Kai Werther
- An Exponential Lower Bound for Depth 3 Arithmetic Circuits
- ESPRIT BR Working Group { 7097 (RAND) Annual Progress Report
- A Simpli ed Realization of the Hopcroft-Karp Approach to Maximum Matching in General
- Some Separation Problems on Randomized OBDDs
- Computational Complexity of Sparse Real Algebraic Function Interpolation
- A Lower Bound on the Size of Algebraic Decision Trees for the MAX Problem
- On Some Tighter Inapproximability Results, Further Improvements
- Phylogenetic Trees Our Algorithm
- Application for Enrolment for Summer Semester 2012 Please come to the Student Secretariat in person during the registration period (see page 5), bringing along the
- Computation of the Additive Complexity of Algebraic Circuits with Root Extracting
- Approximation Schemes for the Betweenness Problem in Tournaments
- Randomized (n2) Lower Bound for Dima Grigoriev Marek Karpinskiy
- Proactive Botnet Countermeasures An Offensive Approach
- On LR(k)-parsers of polynomial size Norbert Blum
- Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication
- c 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any
- Compact Cellular Algebras and Permutation Groups Sergei Evdokimov Marek Karpinski yIlia Ponomarenko z
- Approximating Transitive Reductions for Directed Networks
- A note on improving the running time of a class of parallel algorithms using randomization
- ESPRIT BR Project RAND-REC ( EC-US Exploratory Collaborative Activity {
- Approximating Volumes and Integrals Via the VC -Dimension
- Random Sampling and Approximation of MAX-CSP Problems
- There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a Two-Way
- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
- Quantum Finite Multitape Automata Andris Ambainis (Berkeley)
- ESPRIT BR Project RAND-REC ( EC-US Exploratory Collaborative Activity {
- Approximating Hu man Codes in Parallel (Revised Version)
- Intuitive Multimodal Interaction for Service Robots Matthias Nieuwenhuisen, Jorg Stuckler, and Sven Behnke
- A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs
- Robust Real-Time Audiotransmission over Lossy Christoph Gunzel
- Ecient Parallel Computation of Nearest Neighbor Interchange Distances
- Approximation Hardness of TSP with Bounded Metrics (Revised Version)
- Polynomial Time Approximation Schemes for Dense Instances of
- Polynomial Time Approximation Schemes for Some Dense Instances of
- Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
- On a New High Dimensional Weisfeiler-Lehman Sergei Evdokimov Marek Karpinski yIlia Ponomarenko z
- A Factor 3/2 Approximation for Generalized Steiner Tree Problem with
