Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ARSCOM
2008
103views more  ARSCOM 2008»
10 years 12 months ago
Estimating the number of graphs containing very long induced paths
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
AMC
2008
82views more  AMC 2008»
10 years 12 months ago
Parameter estimation error bounds for Hammerstein nonlinear finite impulsive response models
This paper presents a parameter estimation algorithm for a class of Hammerstein nonlinear systems
Li Yu, Jiabo Zhang, Yuwu Liao, Jie Ding
GLOBECOM
2008
IEEE
10 years 12 months ago
On the Capacity of One-Sided Two User Gaussian Fading Broadcast Channels
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
IPCO
1993
98views Optimization» more  IPCO 1993»
11 years 1 months ago
A spectral approach to bandwidth and separator problems in graphs
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,...
AAAI
1996
11 years 1 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
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
FLAIRS
1998
11 years 1 months ago
Propagating Probabilities in System P
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
UAI
2004
11 years 1 months ago
A Complete Anytime Algorithm for Treewidth
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
NIPS
2004
11 years 1 months ago
Variational Minimax Estimation of Discrete Distributions under KL Loss
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
NIPS
2004
11 years 1 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
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
DLOG
2003
11 years 1 months ago
Complexity of Reasoning
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
books