2516 search results - page 22 / 504 » When is there a representer theorem |
173
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
184
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
168
Voted
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
153
click to vote
CN
2006
15 years 6 months ago
2006
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
154
Voted
AAAI
1994
15 years 7 months ago
1994
We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and ...