Sciweavers

2373 search results - page 100 / 475
» Complexities for generalized models of self-assembly
Sort
View
ATAL
2006
Springer
15 years 8 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
AUSAI
2006
Springer
15 years 8 months ago
An Analysis of Three Puzzles in the Logic of Intention
In this paper, we generalize our formal approach to modelling PRS agents away from PRS-specific assumptions to more general theories of rationality, while not losing the concretene...
Wayne Wobcke
SWAT
2000
Springer
97views Algorithms» more  SWAT 2000»
15 years 8 months ago
I/O-Space Trade-Offs
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
Lars Arge, Jakob Pagter
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
15 years 10 months ago
Syndrome-Based Light-Weight Video Coding for Mobile Wireless Application
In conventional video coding, the complexity of an encoder is generally much higher than that of a decoder because of operations such as motion estimation consume significant com...
Min Wu, Guogang Hua, Chang Chen
ICML
2003
IEEE
16 years 5 months ago
Margin Distribution and Learning
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
Ashutosh Garg, Dan Roth