2657 search results - page 320 / 532 » On the complexity of hierarchical problem solving |
194
Voted
BMCBI
2008
15 years 7 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
195
click to vote
MICCAI
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Automatic delineation and robust measurement of fetal anatomical structures in 2D ultrasound images is a challenging task due to the complexity of the object appearance, ...
151
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...
175
click to vote
C5
2006
IEEE
16 years 26 days ago
2006
IEEE
We present a framework that we are developing to better solve several critical issues that arise when interactive systems are extended to large displays. These issues include slow...
194
click to vote
MFCS
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...