Sciweavers

    3946 search results - page 11 / 790
    » The computational complexity of choice sets
    Sort
    View
    CHI
    2006
    ACM
    131views Human Computer Interaction» more  CHI 2006»
    Non-visual overviews of complex data sets
    16 years 7 months ago
    Non-visual overviews of complex data sets
    Download  www.dcs.gla.ac.uk
    Johan Kildal, Stephen A. Brewster
    claim paper
    Read More »
    HPCA
    2002
    IEEE
    152views Distributed And Parallel Com...» more  HPCA 2002»
    Exploiting Choice in Resizable Cache Design to Optimize Deep-Submicron Processor Energy-Delay
    16 years 7 months ago
    Exploiting Choice in Resizable Cache Design to Optimize Deep-Submicron Processor Energy-Delay
    Download  www.ece.cmu.edu
    Cache memories account for a significant fraction of a chip's overall energy dissipation. Recent research advocates using "resizable" caches to exploit cache requir...
    Se-Hyun Yang, Michael D. Powell, Babak Falsafi, T....
    claim paper
    Read More »
    203
    Voted
    ACL
    2011
    187views Computational Linguistics» more  ACL 2011»
    Learning From Collective Human Behavior to Introduce Diversity in Lexical Choice
    14 years 11 months ago
    Learning From Collective Human Behavior to Introduce Diversity in Lexical Choice
    Download  misc.si.umich.edu
    We analyze collective discourse, a collective human behavior in content generation, and show that it exhibits diversity, a property of general collective systems. Using extensive ...
    Vahed Qazvinian, Dragomir R. Radev
    claim paper
    Read More »
    JAIR
    2008
    104views more  JAIR 2008»
    M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
    15 years 7 months ago
    M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
    Download  www.jair.org
    In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
    Adrian Petcu, Boi Faltings, David C. Parkes
    claim paper
    Read More »
    181
    Voted
    FOCS
    2003
    IEEE
    122views Theoretical Computer Science» more  FOCS 2003»
    A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
    16 years 24 days ago
    A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
    Download  www.comp.nus.edu.sg
    Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.