Sciweavers

64 search results - page 7 / 13
» Counter Example for Q-Bucket-Brigade Under Prediction Proble...
Sort
View
STACS
1999
Springer
15 years 1 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
IPSN
2010
Springer
15 years 4 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...
NCA
2002
IEEE
14 years 9 months ago
The Construction of Smooth Models using Irregular Embeddings Determined by a Gamma Test Analysis
One of the key problems in forming a smooth model from input-output data is the determination of which input variables are relevant in predicting a given output. In this paper we ...
Alban P. M. Tsui, Antonia J. Jones, A. Guedes de O...
ICCAD
2009
IEEE
144views Hardware» more  ICCAD 2009»
14 years 7 months ago
Virtual probe: A statistically optimal framework for minimum-cost silicon characterization of nanoscale integrated circuits
In this paper, we propose a new technique, referred to as virtual probe (VP), to efficiently measure, characterize and monitor both inter-die and spatially-correlated intra-die va...
Xin Li, Rob A. Rutenbar, R. D. (Shawn) Blanton
MOR
2007
149views more  MOR 2007»
14 years 9 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha