358 search results - page 2 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
This paper introduces a novel colour-based affine covariant region detector. Our algorithm is an extension of the maximally stable extremal region (MSER) to colour. The extension ...
SPDP
1990
IEEE
13 years 9 months ago
1990
IEEE
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
CCR
2004
13 years 5 months ago
2004
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
IDA
2009
Springer
13 years 10 months ago
2009
Springer
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
ISAAC
2001
Springer
13 years 10 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...