167 search results - page 29 / 34 » On the complexity and approximation of syntenic distance |
WSCG
2003
13 years 9 months ago
2003
Interactive volume sculpting and volume editing often employ surface based visualization techniques, and interactive applications require fast generation and rendering of surface ...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
ESANN
2006
13 years 9 months ago
2006
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...
SBCCI
2003
ACM
14 years 26 days ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...