Sciweavers

    1089 search results - page 201 / 218
    » Randomness and Reducibility
    Sort
    View
    BCS
    2008
    197views Computer Science» more  BCS 2008»
    Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
    13 years 9 months ago
    Fast Estimation of Nonparametric Kernel Density Through PDDP, and its Application in Texture Synthesis
    Download  www.bcs.org
    In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
    Arnab Sinha, Sumana Gupta
    claim paper
    Read More »
    IADIS
    2008
    139views Internet Technology» more  IADIS 2008»
    Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data
    13 years 9 months ago
    Sisa: Seeded Iterative Signature Algorithm for Biclustering Gene Expression Data
    Download  www.iadis.net
    One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...
    Neelima Gupta, Seema Aggarwal
    claim paper
    Read More »
    MASCOTS
    2007
    121views Modeling And Simulation» more  MASCOTS 2007»
    Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment
    13 years 9 months ago
    Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment
    Download  www.cs.purdue.edu
    — The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
    Yu Dong, Wing-Kai Hon, David K. Y. Yau, Jren-Chit ...
    claim paper
    Read More »
    SODA
    2008
    ACM
    109views Algorithms» more  SODA 2008»
    Auctions for structured procurement
    13 years 9 months ago
    Auctions for structured procurement
    Download  www.math.cmu.edu
    This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
    Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
    claim paper
    Read More »
    SODA
    2008
    ACM
    100views Algorithms» more  SODA 2008»
    A tight lower bound for parity in noisy communication networks
    13 years 9 months ago
    A tight lower bound for parity in noisy communication networks
    Download  www.tcs.tifr.res.in
    We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
    Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
    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.