1461 search results - page 179 / 293 » Complexity of Graph Covering Problems |
ICCD
2008
IEEE
14 years 7 months ago
2008
IEEE
— The amount of time and resources that have to be spent on debugging of embedded cores continuously increases. Approaches valid 10 years ago can no longer be used due to the var...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
EVOW
2005
Springer
14 years 3 months ago
2005
Springer
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
SIGCSE
2002
ACM
13 years 9 months ago
2002
ACM
Most courses on Discrete Mathematics are designed to emphasize problem solving, in general. When the goal is to cover the content, the learning and understanding takes a second pl...
LATIN
2010
Springer
13 years 8 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...