358 search results - page 19 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
130
Voted
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
: Significant progress has been made by the computer vision community in recent years along two fronts: (i) developing complex spatial-temporal models for object registration and t...
201
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
152
click to vote
CCGRID
2007
IEEE
15 years 10 months ago
2007
IEEE
Pseudo-periodicity is one of the basic job arrival patterns on data-intensive clusters and Grids. In this paper, a signal decomposition methodology called matching pursuit is appl...
162
click to vote
TC
2002
15 years 3 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
155
Voted
CRYPTO
2001
Springer
15 years 8 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...