2520 search results - page 416 / 504 » The complexity of approximating entropy |
157
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
117
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
163
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
156
click to vote
CONEXT
2005
ACM
15 years 6 months ago
2005
ACM
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
KDD
2010
ACM
15 years 6 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...