287 search results - page 30 / 58 » Communication complexity as a lower bound for learning in ga... |
ALT
2006
Springer
14 years 5 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
CCS
2006
ACM
14 years 12 days ago
2006
ACM
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
ILP
2003
Springer
14 years 1 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...