Sciweavers

    1068 search results - page 152 / 214
    » Extremely randomized trees
    Sort
    View
    CORR
    2008
    Springer
    94views Education» more  CORR 2008»
    Joint Beamforming for Multiaccess MIMO Systems with Finite Rate Feedback
    13 years 10 months ago
    Joint Beamforming for Multiaccess MIMO Systems with Finite Rate Feedback
    Download  ecee.colorado.edu
    Abstract--We consider multiaccess multiple-input multipleoutput (MIMO) systems with finite rate feedback with the aim of understanding how to efficiently employ the given feedback ...
    Wei Dai, Brian Rider, Youjian Liu
    claim paper
    Read More »
    IPL
    2008
    89views more  IPL 2008»
    On the tractability of coloring semirandom graphs
    13 years 10 months ago
    On the tractability of coloring semirandom graphs
    Download  www.math.ucla.edu
    As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
    Julia Böttcher, Dan Vilenchik
    claim paper
    Read More »
    ML
    2008
    ACM
    96views Machine Learning» more  ML 2008»
    Discovering significant patterns
    13 years 10 months ago
    Discovering significant patterns
    Download  www.csse.monash.edu.au
    Pattern discovery techniques, such as association rule discovery, explore large search spaces of potential patterns to find those that satisfy some user-specified constraints. Due...
    Geoffrey I. Webb
    claim paper
    Read More »
    SIAMJO
    2008
    100views more  SIAMJO 2008»
    On the Global Solution of Linear Programs with Linear Complementarity Constraints
    13 years 10 months ago
    On the Global Solution of Linear Programs with Linear Complementarity Constraints
    Download  www.rpi.edu
    This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
    Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
    claim paper
    Read More »
    JGAA
    2007
    135views more  JGAA 2007»
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    13 years 10 months ago
    Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
    Download  www.emis.de
    Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
    Donatello Conte, Pasquale Foggia, Mario Vento
    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.