Sciweavers

    576 search results - page 76 / 116
    » Optimizing Information Agents by Selectively Materializing D...
    Sort
    View
    MP
    2011
    234views Intelligent Agents» more  MP 2011»
    Statistical ranking and combinatorial Hodge theory
    13 years 3 months ago
    Statistical ranking and combinatorial Hodge theory
    Download  math.stanford.edu
    We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
    Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
    claim paper
    Read More »
    ICDE
    2012
    IEEE
    304views Database» more  ICDE 2012»
    Learning-based Query Performance Modeling and Prediction
    11 years 10 months ago
    Learning-based Query Performance Modeling and Prediction
    Download  www.cs.brown.edu
    — Accurate query performance prediction (QPP) is central to effective resource management, query optimization and query scheduling. Analytical cost models, used in current genera...
    Mert Akdere, Ugur Çetintemel, Matteo Rionda...
    claim paper
    Read More »
    JACM
    2008
    91views more  JACM 2008»
    On the minimization of XPath queries
    13 years 8 months ago
    On the minimization of XPath queries
    Download  www.vldb.org
    XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
    Sergio Flesca, Filippo Furfaro, Elio Masciari
    claim paper
    Read More »
    AAAI
    2008
    126views Intelligent Agents» more  AAAI 2008»
    Learning to Analyze Binary Computer Code
    13 years 10 months ago
    Learning to Analyze Binary Computer Code
    Download  pages.cs.wisc.edu
    We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
    Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
    claim paper
    Read More »
    AAAI
    1997
    133views Intelligent Agents» more  AAAI 1997»
    Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
    13 years 9 months ago
    Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
    Download  www.cs.pitt.edu
    Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
    Milos Hauskrecht
    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.