feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • UB Potsdam  (8)
  • Kath. HS Sozialwesen
  • Kunsthochschule Berlin
  • TH Brandenburg
  • Du, Dingzhu  (8)
  • Informatik  (8)
  • 1
    UID:
    b3kat_BV003648695
    Umfang: IX, 238 S.
    ISBN: 7030014383 , 0792303083
    Serie: Mathematics and its applications / Chinese series 1
    Sprache: Englisch
    Fachgebiete: Informatik , Mathematik
    RVK:
    RVK:
    Schlagwort(e): Komplexitätstheorie ; Kombinatorik ; Algorithmentheorie ; Kombinatorische Optimierung ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    Mehr zum Autor: Du, Dingzhu 1948-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    b3kat_BV035599822
    Umfang: 1 Online-Ressource (XIII, 542 S.) , graph. Darst.
    ISBN: 9783642020254 , 9783642020261
    Serie: Lecture notes in computer science 5573
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Kombinatorische Optimierung ; Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    Mehr zum Autor: Du, Dingzhu 1948-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    gbv_316123560
    Umfang: XII, 478 S. , graph. Darst.
    ISBN: 3540677879
    Serie: Lecture notes in computer science 1858
    Anmerkung: Includes bibliographical references and index
    Weitere Ausg.: Erscheint auch als Online-Ausgabe Du, Dingzhu, 1948 - Computing and Combinatorics Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2000 ISBN 9783540449683
    Weitere Ausg.: ISBN 3540677879
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Theoretische Informatik ; Kombinatorische Optimierung ; Theoretische Informatik ; Kombinatorische Optimierung ; Konferenzschrift
    URL: Cover
    Mehr zum Autor: Du, Dingzhu 1948-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    gbv_1649370636
    Umfang: Online-Ressource
    ISBN: 9783540449683 , 3540677879
    Serie: Lecture Notes in Computer Science 1858
    Inhalt: This book constitutes the refereed proceedings of the 6th Annual International Conference on Computing and Combinatorics, COCOON 2000, held in Sydney, Australia in July 2000. The 44 revised full papers presented together with two invited contributions were carefully reviewed and selected from a total of 81 submissions. The book offers topical sections on computational geometry; graph drawing; graph theory and algorithms; complexity, discrete mathematics, and number theory; online algorithms; parallel and distributed computing; combinatorial optimization; data structures and computational biology; learning and cryptography; and automata and quantum computing
    Anmerkung: Includes bibliographical references and index
    Weitere Ausg.: ISBN 9783540677871
    Weitere Ausg.: Buchausg. u.d.T. Computing and combinatorics Berlin : Springer, 2000 ISBN 3540677879
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Theoretische Informatik ; Kombinatorische Optimierung ; Theoretische Informatik ; Kombinatorische Optimierung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Mehr zum Autor: Du, Dingzhu 1948-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    gbv_1671003799
    Umfang: 1 Online-Ressource (xiii, 678 Seiten) , Illustrationen
    ISBN: 9783030261764
    Serie: Lecture notes in computer science 11653
    Inhalt: Algorithm design -- Approximation algorithm -- Graph theory -- Complexity theory -- Problem solving -- Optimization -- Computational biology -- Computational learning -- Communication network -- Logic -- Game theory
    Inhalt: This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi’an, China, in July 2019. The 55 papers presented in this volume were carefully reviewed and selected from 124 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory
    Weitere Ausg.: ISBN 9783030261757
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe COCOON (25. : 2019 : Xi'an) Computing and combinatorics Cham : Springer, 2019 ISBN 9783030261757
    Weitere Ausg.: ISBN 3030261751
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Kombinatorik ; Berechenbarkeit ; Graph ; Konferenzschrift
    Mehr zum Autor: Du, Dingzhu 1948-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    UID:
    gbv_1647667143
    Umfang: Online-Ressource (XVII, 579 p, digital)
    ISBN: 9780387693194
    Serie: Springer Optimization and Its Applications 7
    Inhalt: This volume presents an extensive collection of contributions covering aspects of the exciting and important research field of data mining techniques in biomedicine. Coverage includes new approaches for the analysis of biomedical data; applications of data mining techniques to real-life problems in medical practice; comprehensive reviews of recent trends in the field. The book addresses incorporation of data mining in fundamental areas of biomedical research: genomics, proteomics, protein characterization, and neuroscience.
    Inhalt: This volume presents an extensive collection of chapters covering various aspects of the exciting and important research area of data mining techniques in biomedicine. The topics include: - new approaches for the analysis of biomedical data, - applications of data mining techniques to real-life problems in medical practice, - comprehensive reviews of recent trends in the field. The book addresses the problems arising in fundamental areas of biomedical research, such as genomics, proteomics, protein characterization, and neuroscience. This volume would be of interest to scientists and practitioners working in the field of biomedicine, as well as related areas of engineering, mathematics, and computer science. It can also be helpful to graduate students and young researchers looking for new exciting directions in their work. Since each chapter can be read independently, readers interested in specific problems and applications may find the material of certain chapters useful.
    Anmerkung: Description based upon print version of record , CONTENTS; Preface; List of Contributors; PART I: RECENT METHODOLOGICAL DEVELOPMENTS FOR DATA MINING PROBLEMS IN BIOMEDICINE; Pattern-Based Discriminants in the Logical Analysis of Data; Exploring Microarray Data with Correspondence Analysis; An Ensemble Method of Discovering Sample Classes Using Gene Expression Profiling; CpG Island Identification with Higher Order and Variable Order Markov Models; Data Mining Algorithms for Virtual Screening of Bioactive Compounds; Sparse Component: Analysis: A New Tool for Data Mining; Data Mining Via Entropy and Graph Clustering , Molecular Biology and Pooling DesignAn Optimization Approach to Identify the Relationship between Features and Output of a Multi-label Classifier; Classifying Noisy and Incomplete Medical Data by a Differential Latent Semantic Indexing Approach; Ontology Search and Text Mining of MEDLINE Database; PART II: DATA MINING TECHNIQUES IN DISEASE DIAGNOSIS; Logical Analysis of Computed Tomography Data to Differentiate Entities of Idiopathic Interstitial Pneumonias; Diagnosis of Alport Syndrome by Pattern Recognition Techniques , Clinical Analysis of the Diagnostic Classification of Geriatric DisordersPART III: DATA MINING STUDIES IN GENOMICS AND PROTEOMICS; A Hybrid Knowledge Based-Clustering Multi-Class SVM Approach for Genes Expression Analysis; Mathematical Programming Formulations for Problems in Genomics and Proteomics; Inferring the Origin of the Genetic Code; Deciphering the Structures of Genomic DNA Sequences Using Recurrence Time Statistics; Clustering Proteomics Data Using Bayesian Principal Component Analysis; Bioinformatics for Traumatic Brain Injury: Proteomic Data Mining , PART IV: CHARACTERIZATION AND PREDICTION OF PROTEIN STRUCTUREComputational Methods for Protein Fold Prediction: an Ab-initio Topological Approach; A Topological Characterization of Protein Structure; PART V: APPLICATIONS OF DATA MINING TECHNIQUES TO BRAIN DYNAMICS STUDIES; Data Mining in EEG: Application to Epileptic Brain Disorders; Information Flow in Coupled Nonlinear Systems: Application to the Epileptic Human Brain; Reconstruction of Epileptic Brain Dynamics Using Data Mining Techniques; Automated Seizure Prediction Algorithm and its Statistical Assessment: A Report from Ten Patients , Seizure Predictability in an Experimental Model of EpilepsyNetwork-Based Techniques in EEG Data Analysis and Epileptic Brain Modeling; Index
    Weitere Ausg.: ISBN 9780387693187
    Weitere Ausg.: Buchausg. u.d.T. Data mining in biomedicine New York : Springer, 2007 ISBN 9780387693187
    Weitere Ausg.: ISBN 0387693181
    Sprache: Englisch
    Fachgebiete: Informatik , Biologie
    RVK:
    RVK:
    Schlagwort(e): Biomedizin ; Data Mining ; Data Mining ; Biologie ; Data Mining ; Medizin ; Aufsatzsammlung
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Mehr zum Autor: Du, Dingzhu 1948-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    UID:
    gbv_164739306X
    Umfang: Online-Ressource (digital)
    ISBN: 9783540850977
    Serie: Lecture Notes in Computer Science 5165
    Inhalt: Going Weighted: Parameterized Algorithms for Cluster Editing -- Parameterized Graph Editing with Chosen Vertex Degrees -- Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries -- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets -- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems -- A Parameterized Perspective on Packing Paths of Length Two -- New Algorithms for k-Center and Extensions -- Separating Sublinear Time Computations by Approximate Diameter -- Computational Study on Dominating Set Problem of Planar Graphs -- Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region -- Parameterized Algorithms for Generalized Domination -- Turán Graphs, Stability Number, and Fibonacci Index -- Vertex-Uncertainty in Graph-Problems -- Protean Graphs with a Variety of Ranking Schemes -- Simplicial Powers of Graphs -- On k- Versus (k?+?1)-Leaf Powers -- Flows with Unit Path Capacities and Related Packing and Covering Problems -- Strong Formulations for 2-Node-Connected Steiner Network Problems -- Algorithms and Implementation for Interconnection Graph Problem -- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order -- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks -- Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks -- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems -- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph -- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem -- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs -- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem -- Covering Arrays Avoiding Forbidden Edges -- The Robot Cleans Up -- On Recovering Syntenic Blocks from Comparative Maps -- Automatic Generation of Symmetry-Breaking Constraints -- On the Stable Set Polytope of Claw-Free Graphs -- A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs -- Magic Labelings on Cycles and Wheels -- Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs -- The Clique Corona Operation and Greedoids -- On the Surface Area of the (n, k)-Star Graph -- Enumerating Isolated Cliques in Synthetic and Financial Networks -- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem -- Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays -- Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization -- Stochastic Online Scheduling Revisited -- Delay Management Problem: Complexity Results and Robust Algorithms -- Clustered SplitsNetworks.
    Inhalt: This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008. The 44 revised full papers were carefully reviewed and selected from 84 submissions. The papers feature original research in the areas of combinatorial optimization -- both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
    Weitere Ausg.: ISBN 9783540850960
    Weitere Ausg.: Buchausg. u.d.T. Combinatorial optimization and applications Berlin : Springer, 2008 ISBN 3540850961
    Weitere Ausg.: ISBN 9783540850960
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Kombinatorische Optimierung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Mehr zum Autor: Pandu Rangan, C. 1955-
    Mehr zum Autor: Du, Dingzhu 1948-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Online-Ressource
    Online-Ressource
    Cham : Springer International Publishing | Cham : Imprint: Springer
    UID:
    gbv_1691528137
    Umfang: 1 Online-Ressource(X, 289 p. 42 illus., 25 illus. in color.)
    Ausgabe: 1st ed. 2020.
    ISBN: 9783030416720
    Serie: Theoretical Computer Science and General Issues 12000
    Inhalt: In Memoriam: Ker-I Ko (1950-2018) -- Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity -- The Power of Self-Reducibility Selectivity, Information, and Approximation -- Who Asked Us - How the Theory of Computing Answers, QuestionsAbout Analysis -- Promise Problems on Probability Distributions -- On Nonadaptive Reductions to the Set of Random Strings and its Dense Subsets -- Computability of the Solutions to Navier-Stokes Equations via Recursive Approximation -- Automatic Generation of Structured Overviews over a Very Large Corpus of Documents -- Better Upper Bounds for Searching on a Line with Byzantine Robots -- A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions -- Sequential Location Game on Continuous Directional Star Networks -- Core Decomposition, Maintenance and Applications -- Active and Busy Time Scheduling Problem: a Survey -- A Note on the Position Value for Hypergraph Communication Situations -- An Efficient Approximation Algorithm for the Steiner Tree Problem -- A Review for Submodular Optimization on Machine Scheduling Problems -- Edge Computing Integrated with Blockchain Technologies.
    Inhalt: This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity over real numbers and analysis. He and Harvey Friedman devised a theoretical model for real number computations by extending the computation of Turing machines. He contributed significantly to advancing the theory of structural complexity, especially on polynomial-time isomorphism, instance complexity, and relativization of polynomial-time hierarchy. Ker-I also made many contributions to approximation algorithm theory of combinatorial optimization problems. This volume contains 17 contributions in the area of complexity and approximation. Those articles are authored by researchers over the world, including North America, Europe and Asia. Most of them are co-authors, colleagues, friends, and students of Ker-I Ko.
    Weitere Ausg.: ISBN 9783030416713
    Weitere Ausg.: ISBN 9783030416737
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe International Workshop on Complexity and Approximation (2019 : Tsingtau) Complexity and approximation Cham : Springer Nature, 2020 ISBN 9783030416713
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe ISBN 9783030416737
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Komplexität ; Approximation ; Festschrift ; Konferenzschrift
    URL: Cover
    Mehr zum Autor: Du, Dingzhu 1948-
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz