Sciweavers

7106 search results - page 69 / 1422
» Restricted Complexity, General Complexity
Sort
View
ICML
2007
IEEE
14 years 8 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
JC
2008
84views more  JC 2008»
13 years 7 months ago
On the linear complexity of Sidel'nikov sequences over nonprime fields
We introduce a generalization of Sidel'nikov sequences for arbitrary finite fields. We show that several classes of Sidel'nikov sequences over arbitrary finite fields ex...
Nina Brandstätter, Wilfried Meidl
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
Computational Complexity of Iterated Maps on the Interval
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
Christoph Spandl
AAECC
2007
Springer
133views Algorithms» more  AAECC 2007»
14 years 1 months ago
Linear Complexity and Autocorrelation of Prime Cube Sequences
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
Young-Joon Kim, Seok-Yong Jin, Hong-Yeop Song
CEC
2005
IEEE
14 years 1 months ago
Complementary selection and variation for an efficient multiobjective optimization of complex systems
Real-world applications generally distinguish themselves from theoretical developments in that they are much more complex and varied. As a consequence, better models require more d...
Benoît Bagot, Hartmut Pohlheim