392 search results - page 33 / 79 » Modular Competitiveness for Distributed Algorithms |
ICML
2006
IEEE
16 years 20 days ago
2006
IEEE
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
100
click to vote
ATAL
2005
Springer
15 years 1 months ago
2005
Springer
While there is a broad theoretic foundation for creating computational players for two-player games, such as Chess, the multi-player domain is not as well explored. We make an att...
WAW
2009
Springer
15 years 6 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
IPPS
1996
IEEE
15 years 4 months ago
1996
IEEE
A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning st...
PODC
2003
ACM
15 years 5 months ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...