5995 search results - page 764 / 1199 » Algorithmic Game Theory |
199
Voted
PODC
2006
ACM
16 years 25 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
215
Voted
UAI
1997
15 years 8 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
229
Voted
APLAS
2010
ACM
15 years 5 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
231
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
190
Voted
ICCV
2001
IEEE
16 years 8 months ago
2001
IEEE
Principal Component Analysis (PCA) has been widely used for the representation of shape, appearance, and motion. One drawback of typical PCA methods is that they are least squares...