840 search results - page 101 / 168 » The Complexity of the Extended GCD Problem |
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
HICSS
2008
IEEE
14 years 3 months ago
2008
IEEE
Research has shown that decentralized networks and organizations perform better and have more satisfied members than centralized ones. Further, decentralized self-organizing netwo...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...