40 search results - page 6 / 8 » A New PAC Bound for Intersection-Closed Concept Classes |
SIAMCOMP
1998
13 years 8 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
ATAL
2009
Springer
14 years 16 days ago
2009
Springer
We present and analyze coalitional affinity games, a family of hedonic games that explicitly model the value that an agent receives from being associated with other agents. We pro...
TON
1998
13 years 8 months ago
1998
— Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and lo...
ITNG
2007
IEEE
14 years 2 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
COLT
1997
Springer
14 years 21 days ago
1997
Springer
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...