358 search results - page 51 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
134
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The problem of optimal allocation of monitoring resources for tracking transactions progressing through a distributed system, modeled as a queueing network, is considered. Two for...
116
click to vote
SIGMETRICS
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
157
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...
116
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
133
click to vote
SIAMCOMP
2008
15 years 1 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...