Sciweavers

2520 search results - page 216 / 504
» The complexity of approximating entropy
Sort
View
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
16 years 2 days ago
Structured matrix methods for polynomial root-finding
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
Luca Gemignani
DCC
2004
IEEE
15 years 9 months ago
Joint Source-Channel Decoding of Quasi-Arithmetic Codes
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...
Thomas Guionnet, Christine Guillemot
RSCTC
2000
Springer
139views Fuzzy Logic» more  RSCTC 2000»
15 years 9 months ago
Application of Normalized Decision Measures to the New Case Classification
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
Dominik Slezak, Jakub Wroblewski
ATAL
2008
Springer
15 years 8 months ago
Selecting strategies using empirical game models: an experimental analysis of meta-strategies
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
Christopher Kiekintveld, Michael P. Wellman
NIPS
2004
15 years 7 months ago
Analysis of a greedy active learning strategy
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
Sanjoy Dasgupta