882 search results - page 68 / 177 » On self-embeddings of computable linear orderings |
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Object recognition has made great strides recently. However, the best methods, such as those based on kernelSVMs are highly computationally intensive. The problem of how to accele...
101
click to vote
VISUALIZATION
1998
IEEE
15 years 2 months ago
1998
IEEE
One common problem in the practical application of volume visualization is the proper choice of transfer functions in order to color different parts of the volume meaningfully. Th...
134
click to vote
CONCUR
1993
Springer
15 years 2 months ago
1993
Springer
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
WG
1993
Springer
15 years 2 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
WG
1993
Springer
15 years 2 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...