Sciweavers

    ARSCOM
    2008
    103views more  ARSCOM 2008»
    Estimating the number of graphs containing very long induced paths
    13 years 4 months ago
    Estimating the number of graphs containing very long induced paths
    Download  www.math.ucsd.edu
    Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
    Steven Butler
    claim paper
    Read More »
    AMC
    2008
    82views more  AMC 2008»
    Parameter estimation error bounds for Hammerstein nonlinear finite impulsive response models
    13 years 4 months ago
    Parameter estimation error bounds for Hammerstein nonlinear finite impulsive response models
    Download  www.ece.ualberta.ca
    This paper presents a parameter estimation algorithm for a class of Hammerstein nonlinear systems
    Li Yu, Jiabo Zhang, Yuwu Liao, Jie Ding
    claim paper
    Read More »
    GLOBECOM
    2008
    IEEE
    84views Communications» more  GLOBECOM 2008»
    On the Capacity of One-Sided Two User Gaussian Fading Broadcast Channels
    13 years 4 months ago
    On the Capacity of One-Sided Two User Gaussian Fading Broadcast Channels
    Download  wncg.org
    In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Co...
    Amin Jafarian, Sriram Vishwanath
    claim paper
    Read More »
    IPCO
    1993
    98views Optimization» more  IPCO 1993»
    A spectral approach to bandwidth and separator problems in graphs
    13 years 5 months ago
    A spectral approach to bandwidth and separator problems in graphs
    Download  www-user.tu-chemnitz.de
    Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
    Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
    claim paper
    Read More »
    AAAI
    1996
    119views Intelligent Agents» more  AAAI 1996»
    Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
    13 years 5 months ago
    Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
    Download  www.aaai.org
    Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
    Richard J. Wallace
    claim paper
    Read More »
    FLAIRS
    1998
    97views Artificial Intelligence» more  FLAIRS 1998»
    Propagating Probabilities in System P
    13 years 5 months ago
    Propagating Probabilities in System P
    Download  www.aaai.org
    In this paper wesuggest a wayof using the rules of System P to propagate lower bounds on conditional probabilities. Usinga knowledgebase of default rules whichart, consideredto be...
    Rachel A. Bourne, Simon Parsons
    claim paper
    Read More »
    UAI
    2004
    169views Artificial Intelligence» more  UAI 2004»
    A Complete Anytime Algorithm for Treewidth
    13 years 6 months ago
    A Complete Anytime Algorithm for Treewidth
    Download  www.ics.uci.edu
    In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
    Vibhav Gogate, Rina Dechter
    claim paper
    Read More »
    NIPS
    2004
    101views Information Technology» more  NIPS 2004»
    Variational Minimax Estimation of Discrete Distributions under KL Loss
    13 years 6 months ago
    Variational Minimax Estimation of Discrete Distributions under KL Loss
    Download  books.nips.cc
    We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
    Liam Paninski
    claim paper
    Read More »
    NIPS
    2004
    136views Information Technology» more  NIPS 2004»
    Nearly Tight Bounds for the Continuum-Armed Bandit Problem
    13 years 6 months ago
    Nearly Tight Bounds for the Continuum-Armed Bandit Problem
    Download  books.nips.cc
    In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
    Robert D. Kleinberg
    claim paper
    Read More »
    DLOG
    2003
    114views Automated Reasoning» more  DLOG 2003»
    Complexity of Reasoning
    13 years 6 months ago
    Complexity of Reasoning
    Download  www.inf.unibz.it
    We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
    Francesco M. Donini
    claim paper
    Read More »
    « first‹ previous…5678910111213…next ›last »
    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.