450 search results - page 57 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
SCALESPACE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
127
click to vote
MM
2006
ACM
15 years 5 months ago
2006
ACM
While there have been great advances in quantification of the genotype of organisms, including full genomes for many species, the quantification of phenotype is at a comparatively...
112
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
MODELS
2007
Springer
15 years 6 months ago
2007
Springer
The rising adoption and incorporation of computers into everyday life requires human-computer interaction methods to be efficient and easy to understand. Simultaneously, complexit...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...