5210 search results - page 90 / 1042 » Exact geometric computation |
VISAPP
2010
14 years 7 months ago
2010
IJCV
2012
13 years 8 days ago
2012
FCT
2005
Springer
15 years 3 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
BMCBI
2008
14 years 10 months ago
2008
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
KAIS
2006
14 years 9 months ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...