Sciweavers

    774 search results - page 136 / 155
    » Experiments with an Agent-Oriented Reasoning System
    Sort
    View
    ACL
    2006
    161views Computational Linguistics» more  ACL 2006»
    Minimum Risk Annealing for Training Log-Linear Models
    13 years 9 months ago
    Minimum Risk Annealing for Training Log-Linear Models
    Download  www.cs.jhu.edu
    When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural languag...
    David A. Smith, Jason Eisner
    claim paper
    Read More »
    ECIS
    2003
    151views Information Technology» more  ECIS 2003»
    An empirical investigation of determinants to buy application services from ASPs
    13 years 9 months ago
    An empirical investigation of determinants to buy application services from ASPs
    Download  is2.lse.ac.uk
    The Application Service Provider (ASP) is a pivotal point in the organization of information systems, since it brings up a new paradigm: “make, buy or rent”. An ASP is a compa...
    Vincenzo Morabito
    claim paper
    Read More »
    JOT
    2006
    75views more  JOT 2006»
    Porting the .NET Compact Framework to Symbian Phones
    13 years 7 months ago
    Porting the .NET Compact Framework to Symbian Phones
    Download  dotnet.zcu.cz
    As a result of the increasing availability and processing capacity offered by portable devices, it is important for software providers to offer mobile services that seamlessly int...
    Frank Siegemund, Robert Sugar, Alain Gefflaut, Fri...
    claim paper
    Read More »
    JSAC
    2007
    128views more  JSAC 2007»
    Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
    13 years 7 months ago
    Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
    Download  media.cs.tsinghua.edu.cn
    — Most of the real deployed peer-to-peer streaming systems adopt pull-based streaming protocol. In this paper, we demonstrate that, besides simplicity and robustness, with proper...
    Meng Zhang, Qian Zhang, Lifeng Sun, Shiqiang Yang
    claim paper
    Read More »
    PPOPP
    2009
    ACM
    169views Distributed and Parallel Com...» more  PPOPP 2009»
    An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
    14 years 8 months ago
    An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
    Download  www.cc.gatech.edu
    Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
    Seunghwa Kang, David A. Bader
    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.