Sciweavers

534 search results - page 29 / 107
» Approximation of Indistinct Concepts
Sort
View
COLT
2007
Springer
14 years 1 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
MOBIHOC
2010
ACM
13 years 5 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
ICC
2011
IEEE
205views Communications» more  ICC 2011»
12 years 7 months ago
Decentralized Cross-Tier Interference Mitigation in Cognitive Femtocell Networks
—In this paper, recent results in game theory and stochastic approximation are brought together to mitigate the problem of femto-to-macrocell cross-tier interference. The main re...
Mehdi Bennis, Samir Medina Perlaza
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
14 years 10 days ago
A contractivity approach for probabilistic bisimulations of diffusion processes
— This work is concerned with the problem of characterizing and computing probabilistic bisimulations of diffusion processes. A probabilistic bisimulation relation between two su...
Alessandro Abate
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 8 months ago
Hierarchical evolution of linear regressors
We propose an algorithm for function approximation that evolves a set of hierarchical piece-wise linear regressors. The algorithm, named HIRE-Lin, follows the iterative rule learn...
Francesc Teixidó-Navarro, Albert Orriols-Pu...