Sciweavers

    429 search results - page 22 / 86
    » Solving the Maximum Clique Problem Using PUBB
    Sort
    View
    ICASSP
    2009
    IEEE
    243views Signal Processing» more  ICASSP 2009»
    Principal component analysis in decomposable Gaussian graphical models
    13 years 11 months ago
    Principal component analysis in decomposable Gaussian graphical models
    Download  projects.csail.mit.edu
    We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...
    Ami Wiesel, Alfred O. Hero III
    claim paper
    Read More »
    DAC
    1995
    ACM
    144views Computer Architecture» more  DAC 1995»
    Register Allocation and Binding for Low Power
    13 years 11 months ago
    Register Allocation and Binding for Low Power
    Download  www.cse.nd.edu
    This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
    Jui-Ming Chang, Massoud Pedram
    claim paper
    Read More »
    JAIR
    1998
    92views more  JAIR 1998»
    The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
    13 years 7 months ago
    The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
    Download  www.jair.org
    Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
    Basil Vandegriend, Joseph C. Culberson
    claim paper
    Read More »
    AAAI
    2006
    105views Intelligent Agents» more  AAAI 2006»
    An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
    13 years 9 months ago
    An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem
    Download  www.aaai.org
    We present an asymptotically optimal algorithm for the max variant of the k-armed bandit problem. Given a set of k slot machines, each yielding payoff from a fixed (but unknown) d...
    Matthew J. Streeter, Stephen F. Smith
    claim paper
    Read More »
    NIPS
    2004
    169views Information Technology» more  NIPS 2004»
    Maximum Margin Clustering
    13 years 9 months ago
    Maximum Margin Clustering
    Download  www.cs.uwaterloo.ca
    We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
    Linli Xu, James Neufeld, Bryce Larson, Dale Schuur...
    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.