1629 search results - page 290 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
SRDS
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper presents an instance based approach to diagnosing failures in computing systems. Owing to the fact that a large portion of occurred failures are repeated ones, our meth...
ICCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. An algorithm to detect invisible relevant persons in a homogeneous social network is studied with computer simulation. The network is effective as a model for contempora...
100
click to vote
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
CASES
2010
ACM
14 years 7 months ago
2010
ACM
Dynamic binary translators (DBTs) are becoming increasingly important because of their power and flexibility. However, the high memory demands of DBTs present an obstacle for all ...
108
click to vote
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...