5995 search results - page 119 / 1199 » Algorithmic Game Theory |
136
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
109
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Analysis and design of ltered-x adaptive algorithms are conventionally done by assuming that the transfer function in the secondary path is a discrete-time system. However, in rea...
142
Voted
PKDD
2001
Springer
15 years 8 months ago
2001
Springer
This paper discusses the clustering quality and complexities of the hierarchical data clustering algorithm based on gravity theory. The gravitybased clustering algorithm simulates ...
150
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
132
Voted
IPCO
2010
15 years 5 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...