276 search results - page 31 / 56 » The Complexity of Computing Maximal Word Functions |
JCSS
2008
13 years 7 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
ACCESSNETS
2009
Springer
13 years 11 months ago
2009
Springer
In EPONs, differentiated services enable higher quality of service (QoS) for some queues over others. However, owing to the coarse granularity of DiffServ, DiffServ in EPONs can ha...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Many applications require a computer representation of 2D shape, usually described by a set of 2D points. The challenge of this representation is that it must not only capture the...
ENTCS
2007
13 years 7 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
NPL
2006
13 years 7 months ago
2006
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...