683 search results - page 18 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
197
Voted
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...
141
Voted
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Recent results on sparse coding and independent component analysis suggest that human vision first represents a visual image by a linear superposition of a relatively small number ...
124
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we propose a methodology for developing component-based real-time systems based on the concept of hierarchical scheduling. Recently, much work has been devoted to t...
148
Voted
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
147
Voted
PLDI
1993
ACM
15 years 7 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...