Sciweavers

    1093 search results - page 210 / 219
    » Crossover in Probability Spaces
    Sort
    View
    ICWN
    2008
    159views Wireless Networks» more  ICWN 2008»
    Progressive Content-Sensitive Data Retrieval in Sensor Networks
    13 years 10 months ago
    Progressive Content-Sensitive Data Retrieval in Sensor Networks
    Download  www.scipub.org
    : Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
    Bo Yang, Mareboyana Manohar, Shaoying Kou
    claim paper
    Read More »
    SODA
    2008
    ACM
    104views Algorithms» more  SODA 2008»
    Fast and reliable reconstruction of phylogenetic trees with very short edges
    13 years 10 months ago
    Fast and reliable reconstruction of phylogenetic trees with very short edges
    Download  www.cs.technion.ac.il
    Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
    Ilan Gronau, Shlomo Moran, Sagi Snir
    claim paper
    Read More »
    AAAI
    2006
    103views Intelligent Agents» more  AAAI 2006»
    Model Counting: A New Strategy for Obtaining Good Bounds
    13 years 10 months ago
    Model Counting: A New Strategy for Obtaining Good Bounds
    Download  www.cs.ubc.ca
    Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
    Carla P. Gomes, Ashish Sabharwal, Bart Selman
    claim paper
    Read More »
    AIPS
    2006
    133views Artificial Intelligence» more  AIPS 2006»
    Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
    13 years 10 months ago
    Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
    Download  users.cecs.anu.edu.au
    We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
    Jinbo Huang
    claim paper
    Read More »
    NIPS
    1990
    266views Information Technology» more  NIPS 1990»
    Bumptrees for Efficient Function, Constraint and Classification Learning
    13 years 10 months ago
    Bumptrees for Efficient Function, Constraint and Classification Learning
    Download  www.icsi.berkeley.edu
    A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
    Stephen M. Omohundro
    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.