350 search results - page 12 / 70 » Hardness Results for Homology Localization |
EUROPAR
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
PERCOM
2010
ACM
13 years 5 months ago
2010
ACM
—The widespread use of tracking and localization systems may be hindered by centralized server platforms whose performance can hardly scale up to the needs of very large numbers ...
IWINAC
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
TAINN
2005
Springer
14 years 25 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
CSB
2003
IEEE
14 years 20 days ago
2003
IEEE
As gene order evolves through a variety of chromosomal rearrangements, conserved segments provide important insight into evolutionary relationships and functional roles of genes. ...