Sciweavers

    1041 search results - page 146 / 209
    » Randomizing Reductions of Search Problems
    Sort
    View
    DATE
    2005
    IEEE
    129views Hardware» more  DATE 2005»
    Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling
    14 years 1 months ago
    Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling
    Download  www.nd.edu
    A novel energy reduction strategy to maximally exploit the dynamic workload variation is proposed for the offline voltage scheduling of preemptive systems. The idea is to construc...
    Lap-Fai Leung, Chi-Ying Tsui, Xiaobo Sharon Hu
    claim paper
    Read More »
    ACL
    2006
    179views Computational Linguistics» more  ACL 2006»
    Combining Statistical and Knowledge-Based Spoken Language Understanding in Conditional Models
    13 years 9 months ago
    Combining Statistical and Knowledge-Based Spoken Language Understanding in Conditional Models
    Download  research.microsoft.com
    Spoken Language Understanding (SLU) addresses the problem of extracting semantic meaning conveyed in an utterance. The traditional knowledge-based approach to this problem is very...
    Ye-Yi Wang, Alex Acero, Milind Mahajan, John Lee
    claim paper
    Read More »
    COMPGEOM
    2011
    ACM
    220views Discrete Geometry» more  COMPGEOM 2011»
    An output-sensitive algorithm for persistent homology
    12 years 11 months ago
    An output-sensitive algorithm for persistent homology
    Download  pub.ist.ac.at
    In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
    Chao Chen, Michael Kerber
    claim paper
    Read More »
    KDD
    2008
    ACM
    128views Data Mining» more  KDD 2008»
    Bypass rates: reducing query abandonment using negative inferences
    14 years 8 months ago
    Bypass rates: reducing query abandonment using negative inferences
    Download  research.microsoft.com
    We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
    Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
    claim paper
    Read More »
    KDD
    2007
    ACM
    192views Data Mining» more  KDD 2007»
    Active exploration for learning rankings from clickthrough data
    14 years 8 months ago
    Active exploration for learning rankings from clickthrough data
    Download  radlinski.org
    We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
    Filip Radlinski, Thorsten Joachims
    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.