674 search results - page 16 / 135 » The computational complexity of the parallel knock-out probl... |
GI
2004
Springer
14 years 24 days ago
2004
Springer
: With the growing complexity of parallel architectures, the probability of system failures grows, too. One approach to cope with this problem is the self-healing, one of the organ...
CF
2007
ACM
13 years 11 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
NPC
2010
Springer
13 years 5 months ago
2010
Springer
Achieving high performance on today’s architectures requires careful orchestration of many optimization parameters. In particular, the presence of shared-caches on multicore arch...
ACCV
2006
Springer
13 years 11 months ago
2006
Springer
Stochastic grammar has been used in many video analysis and event recognition applications as an efficient model to represent large-scale video activity. However, in previous works...