3946 search results - page 30 / 790 » The computational complexity of choice sets |
TSD
2000
Springer
15 years 3 months ago
2000
Springer
Lots of words can be said about the importance of speaker identification for people, but no word might be as meaningful as the imagination of a life without having any speaker iden...
76
Voted
ICCV
2005
IEEE
15 years 5 months ago
2005
IEEE
We advocate the use of Scaled Gaussian Process Latent Variable Models (SGPLVM) to learn prior models of 3D human pose for 3D people tracking. The SGPLVM simultaneously optimizes a...
ACMIDC
2009
15 years 3 months ago
2009
In tangible learning environments the potential to exploit different physical-digital links increases representational power but also broadens the complexity of design. This paper...
CPM
2008
Springer
15 years 1 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
PC
2010
14 years 10 months ago
2010
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...