4865 search results - page 682 / 973 » The Complexity of Graph Connectivity |
126
click to vote
COCO
2003
Springer
15 years 10 months ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
147
click to vote
ICCS
2003
Springer
15 years 10 months ago
2003
Springer
Biomedical systems involve complex interactions between diverse components. Problem solving in such systems requires insight, i.e. the capability to make non-obvious connections. I...
128
click to vote
TAMC
2010
Springer
15 years 10 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
154
click to vote
IEEEPACT
2002
IEEE
15 years 10 months ago
2002
IEEE
Clustering is an effective microarchitectural technique for reducing the impact of wire delays, the complexity, and the power requirements of microprocessors. In this work, we inv...
220
Voted
ISBI
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper we present a novel method for the 3D centerline extraction of elongated objects such as vessels. This method unites the basic ideas in distance transformbased, thinn...