Sciweavers

    250 search results - page 30 / 50
    » Fixed Argument Pairings
    Sort
    View
    TOG
    2010
    153views more  TOG 2010»
    Content-adaptive parallax barriers: optimizing dual-layer 3D displays using low-rank light field factorization
    13 years 4 months ago
    Content-adaptive parallax barriers: optimizing dual-layer 3D displays using low-rank light field factorization
    Download  web.media.mit.edu
    We optimize automultiscopic displays built by stacking a pair of modified LCD panels. To date, such dual-stacked LCDs have used heuristic parallax barriers for view-dependent imag...
    Douglas Lanman, Matthew Hirsch, Yunhee Kim, Ramesh...
    claim paper
    Read More »
    CN
    2006
    91views more  CN 2006»
    Reputation-based policies that provide the right incentives in peer-to-peer environments
    13 years 10 months ago
    Reputation-based policies that provide the right incentives in peer-to-peer environments
    Download  nslab.ee.ntu.edu.tw
    Peer-to-peer are popular environments for exchanging services. A reputation mechanism is a proper means of discovering low-performing peers that fail to provide their services. In...
    Thanasis G. Papaioannou, George D. Stamoulis
    claim paper
    Read More »
    ICFP
    2007
    ACM
    113views Programming Languages» more  ICFP 2007»
    Relating complexity and precision in control flow analysis
    14 years 9 months ago
    Relating complexity and precision in control flow analysis
    Download  www.cs.brandeis.edu
    We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
    David Van Horn, Harry G. Mairson
    claim paper
    Read More »
    TCS
    2008
    144views Theoretical Computer Science» more  TCS 2008»
    Algorithms for computing variants of the longest common subsequence problem
    13 years 9 months ago
    Algorithms for computing variants of the longest common subsequence problem
    Download  www.dcs.kcl.ac.uk
    The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
    Costas S. Iliopoulos, M. Sohel Rahman
    claim paper
    Read More »
    PAM
    2010
    Springer
    159views Computer Networks» more  PAM 2010»
    Quantifying the Pitfalls of Traceroute in AS Connectivity Inference
    14 years 4 months ago
    Quantifying the Pitfalls of Traceroute in AS Connectivity Inference
    Download  irl.cs.ucla.edu
    Although traceroute has the potential to discover AS links that are invisible to existing BGP monitors, it is well known that the common approach for mapping router IP address to A...
    Yu Zhang, Ricardo V. Oliveira, Hongli Zhang, Lixia...
    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.