Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 2000-2004  (2)
  • Konferenzschrift  (2)
  • 1
    UID:
    gbv_1649270380
    Format: Online-Ressource
    ISBN: 9783540456551 , 354043996X
    Series Statement: Lecture Notes in Computer Science 2387
    Content: Invited Lectures -- The Assembly of the Human and Mouse Genomes -- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching -- DNA Complementarity and Paradigms of Computing -- Complexity Theory I -- On Higher Arthur-Merlin Classes -- (2 + f(n))-SAT and Its Properties -- On the Minimal Polynomial of a Matrix -- Computable Real Functions of Bounded Variation and Semi-computable Real Numbers -- Discrete Algorithms I -- Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees -- Coloring Algorithms on Subcubic Graphs -- Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs -- Extending the Accommodating Function -- Computational Biology and Learning Theory I -- Inverse Parametric Sequence Alignment -- The Full Steiner Tree Problem in Phylogeny -- Inferring a Union of Halfspaces from Examples -- Dictionary Look-Up within Small Edit Distance -- Coding Theory and Cryptography -- Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm -- Co-orthogonal Codes -- Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2m) -- A Combinatorial Approach to Anonymous Membership Broadcast -- Parallel and Distributed Architectures -- Solving Constraint Satisfaction Problems with DNA Computing -- New Architecture and Algorithms for Degradable VLSI/WSI Arrays -- Cluster: A Fast Tool to Identify Groups of Similar Programs -- Broadcasting in Generalized de Bruijn Digraphs -- Graph Theory -- On the Connected Domination Number of Random Regular Graphs -- On the Number of Minimum Cuts in a Graph -- On Crossing Numbers of 5-Regular Graphs -- Maximum Flows and Critical Vertices in AND/OR Graphs -- Radio Networks -- New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks -- Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model -- Time and Energy Optimal List Ranking Algorithms on the k-Channel Broadcast Communication Model -- Energy-Efficient Size Approximation of Radio Networks with No Collision Detection -- Automata and Formal Languages -- A New Class of Symbolic Abstract Neural Nets: Tissue P Systems -- Transducers with Set Output -- Self-assembling Finite Automata -- Repetition Complexity of Words -- Internet Networks -- Using PageRank to Characterize Web Structure -- On Randomized Broadcasting and Gossiping in Radio Networks -- Fast and Dependable Communication in Hyper-rings -- Computational Geometry I -- The On-Line Heilbronn’s Triangle Problem in Three and Four Dimensions -- Algorithms for Normal Curves and Surfaces -- Terrain Polygon Decomposition, with Application to Layered Manufacturing -- Computational Biology and Learning Theory II -- Supertrees by Flipping -- A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays -- Sharpening Occam’s Razor -- Approximating 3D Points with Cylindrical Segments -- Discrete Algorithms II -- Algorithms for the Multicolorings of Partial k-Trees -- A Fault-Tolerant Merge Sorting Algorithm -- 2-Compromise Usability in 1-Dimensional Statistical Databases -- Computational Geometry II -- An Experimental Study and Comparison of Topological Peeling and Topological Walk -- On-Line Maximizing the Number of Items Packed in Variable-Sized Bins -- On-Line Grid-Packing with a Single Active Grid -- Bend Minimization in Orthogonal Drawings Using Integer Programming -- Combinatorial Optimization -- The Conditional Location of a Median Path -- New Results on the k-Truck Problem -- Theory of Equal-Flows in Networks -- Minimum Back-Walk-Free Latency Problem -- Complexity II -- Counting Satisfying Assignments in 2-SAT and 3-SAT -- On the Maximum Number of Irreducible Coverings of an n-Vertex Graph by n — 3 Cliques -- On Reachability in Graphs with Bounded Independence Number -- On Parameterized Enumeration -- Quantum Computing -- Probabilistic Reversible Automata and Quantum Automata -- Quantum versus Deterministic Counter Automata -- Quantum DNF Learnability Revisited.
    Note: Lizenzpflichtig
    Additional Edition: ISBN 9783540439967
    Additional Edition: Buchausg. u.d.T. Computing and combinatorics Berlin : Springer, 2002 ISBN 354043996X
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Theoretische Informatik ; Kombinatorik ; Berechenbarkeit ; Theoretische Informatik ; Kombinatorik ; Berechenbarkeit ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    gbv_1649368801
    Format: Online-Ressource
    ISBN: 9783540451518 , 3540676279
    Series Statement: Lecture Notes in Computer Science 1846
    Content: Invited Talks -- Visual Data Mining for Business Intelligence Applications -- Parallel Data Mining on Large Scale PC Cluster -- XML: DTD and Queries -- XML Query Languages in Practice: An Evaluation -- A Two-Level Method for Clustering DTDs1 -- XML Queries via SQL -- Inferring DTD to Facilitate User-Oriented XML Documents Query -- O-O: Modeling and Implementation -- An Object Oriented Multidimensional Data Model for OLAP -- Applying Object-Oriented Conceptual Modeling Techniques to the Design of Multidimensional Databases and OLAP Applications -- An Optimal Locking Scheme in Object-Oriented Database Systems -- Association Rules: Mining and Application -- An Efficient Distributed Algorithm for Computing Association Rules -- Mining Association Rules with Negative Items Using Interest Measure -- Probabilistic Approach to Association Rules in Incomplete Databases -- Discovering Sequential Patterns from Non-uniform Databases -- An Effective Approach to Mining Exception Class Association Rules1 -- Enterprise Information Systems and E-Commerce -- Integrated Data Management and Enterprise Models -- A Virtual Private Network for Virtual Enterprise Information Systems -- Adaptive Online Retail Web Site Based on Hidden Markov Model -- A Protocol for Untraceable Electronic Cash -- The Web: Document Management and Retrieval -- Materializing Web Data for OLAP and DSS -- Hierarchically Classifying Chinese Web Documents without Dictionary Support and Segmentation Procedure1 -- Web Clustering and Association Rule Discovery for Web Broadcast -- A Non-Euclidean Model for Web Retrieval -- Advanced Replacement Policies for WWW Caching -- Spatial and Temporal Databases -- Extending Rectangle Join Algorithms for Rectilinear Polygons -- HMT: Modeling Temporal Aspects in Hypermedia Applications -- Hana Tree: A Dynamic and Robust Access Method for Spatial Data Handling -- MADGIS: A New Architecture for Distributed GIS under Internet Environment -- Data Warehousing -- Global View Maintenance by Using Inference Relationship among Views -- Maintaining Materialized Views for Data Warehouses with Multiple Remote Sources -- Using Loglinear Models to Compress Datacubes -- Materialized View Selection in a Data Warehouse -- Information Retrieval -- ExSight: Highly Accurate Object Based Image Retrieval System Enhanced by Redundant Object Extraction -- Applying Anaphora Resolution to Question Answering and Information Retrieval Systems -- MB+tree: A Dynamically Updatable Metric Index for Similarity Search -- An Information Store and Retrieval Facility on CORBA -- Retrieving Content Directly from Antique Book Images -- Semi-Structured Data -- Schema Based Data Storage and Query Optimization for Semi-structured Data1 -- Automatic Wrapper Generation for Web Search Engines -- Multi-level Schema Extraction for Heterogeneous Semi-structured Data -- Agent, Rough Set and Learning -- Rough Set Based WebCT Learning -- MultiAgent Systems for Coalition Support -- A Fast Globally Supervised Learning Algorithm for Gaussian Mixture Models -- Optimizing Classifiers by Genetic Algorithm.
    Content: Database research and development has been remarkably successful over the past three decades. Now the field is facing new challenges posted by the rapid advances of technology, especially the penetration of the Web and Internet into everyone's daily life. The economical and financial environment where database systems are used has been changing dramatically. In addition to being able to efficiently manage a large volume of operational data generated internally, the ability to manage data in cyberspace, extract relevant information, and discover knowledge to support decision making is critical to the success of any organization. In order to provide researchers and practitioners with a forum to share their experiences in tackling problems in managing and using data, information, and knowledge in the age of the Internet and Web, the First International Conference on Web-Age Information Management (WAIM 2000) was held in Shanghai, China, June 21-23. The inaugural conference in its series was well received. Researchers from 17 countries and regions, including Austria, Australia, Bahrain, Canada, China, France, Germany, Japan, Korea, Malaysia, The Netherlands, Poland, Singapore, Spain, Taiwan, UK, and USA submitted their recent work. Twenty-seven regular and 14 short papers contained in these proceedings were presented during the two-day conference. These papers cover a large spectrum of issues, from classical data management such as object-oriented modeling, spatial and temporal databases to recent hits like data mining, data warehousing, semi-structured data, and XML.
    Note: Lizenzpflichtig
    Additional Edition: ISBN 9783540676270
    Additional Edition: Buchausg. u.d.T. Web-age information management Berlin : Springer, 2000 ISBN 3540676279
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: World Wide Web ; Information Retrieval ; World Wide Web ; Wissensextraktion ; Data Mining ; Data-Warehouse-Konzept ; Electronic Commerce ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages