Sciweavers

4324 search results - page 71 / 865
» A Generalized Representer Theorem
Sort
View
ALT
2002
Springer
16 years 29 days ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
15 years 8 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
ICML
1994
IEEE
15 years 7 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
TCS
2008
15 years 3 months ago
On different generalizations of episturmian words
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
TNN
2008
106views more  TNN 2008»
15 years 3 months ago
Stability and Hopf Bifurcation of a General Delayed Recurrent Neural Network
In this paper, stability and bifurcation of a general recurrent neural network with multiple time delays is considered, where all the variables of the network can be regarded as bi...
Wenwu Yu, Jinde Cao, Guanrong Chen