Sciweavers

    1653 search results - page 292 / 331
    » Computer science and game theory
    Sort
    View
    SDM
    2009
    SIAM
    152views Data Mining» more  SDM 2009»
    Non-negative Matrix Factorization, Convexity and Isometry.
    14 years 6 months ago
    Non-negative Matrix Factorization, Convexity and Isometry.
    Download  www.siam.org
    In this paper we explore avenues for improving the reliability of dimensionality reduction methods such as Non-Negative Matrix Factorization (NMF) as interpretive exploratory data...
    Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
    claim paper
    Read More »
    SDM
    2009
    SIAM
    191views Data Mining» more  SDM 2009»
    Adaptive Concept Drift Detection.
    14 years 6 months ago
    Adaptive Concept Drift Detection.
    Download  www.siam.org
    An established method to detect concept drift in data streams is to perform statistical hypothesis testing on the multivariate data in the stream. Statistical decision theory off...
    Anton Dries, Ulrich Rückert
    claim paper
    Read More »
    SDM
    2009
    SIAM
    331views Data Mining» more  SDM 2009»
    Privacy Preservation in Social Networks with Sensitive Edge Weights.
    14 years 6 months ago
    Privacy Preservation in Social Networks with Sensitive Edge Weights.
    Download  www.siam.org
    With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
    Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
    claim paper
    Read More »
    LICS
    2009
    IEEE
    102views Automated Reasoning» more  LICS 2009»
    The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
    14 years 3 months ago
    The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
    Download  www.labri.fr
    The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
    Jérôme Leroux
    claim paper
    Read More »
    LICS
    2009
    IEEE
    138views Automated Reasoning» more  LICS 2009»
    An Improved Lower Bound for the Complementation of Rabin Automata
    14 years 3 months ago
    An Improved Lower Bound for the Complementation of Rabin Automata
    Download  people.csail.mit.edu
    Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
    Yang Cai, Ting Zhang, Haifeng Luo
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.