37 search results - page 7 / 8 » The Hardness of 3 - Uniform Hypergraph Coloring |
VISUALIZATION
2005
IEEE
13 years 11 months ago
2005
IEEE
Real-time rendering of massively textured 3D scenes usually involves two major problems: Large numbers of texture switches are a well-known performance bottleneck and the set of s...
MIR
2010
ACM
13 years 7 months ago
2010
ACM
This paper presents a classification-driven biomedical image retrieval system to bride the semantic gap by transforming image features to their global categories at different gran...
COCO
2009
Springer
14 years 5 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
INFOVIS
2005
IEEE
13 years 11 months ago
2005
IEEE
The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical...