1450 search results - page 63 / 290 » On the Complexity of Hardness Amplification |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
MM
2006
ACM
14 years 3 months ago
2006
ACM
We create interactive art that can be enjoyed by groups such as audiences at public events with the intent to encourage communication with those around us as we play with the art....
PODC
2006
ACM
14 years 3 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
COMPGEOM
2003
ACM
14 years 2 months ago
2003
ACM
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...