Sciweavers

836 search results - page 95 / 168
» On the Complexity of Train Assignment Problems
Sort
View
DAGM
2010
Springer
15 years 5 months ago
Gaussian Mixture Modeling with Gaussian Process Latent Variable Models
Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristi...
Hannes Nickisch, Carl Edward Rasmussen
CVPR
2011
IEEE
14 years 11 months ago
Supervised Local Subspace Learning for Continuous Head Pose Estimation
Head pose estimation from images has recently attracted much attention in computer vision due to its diverse applications in face recognition, driver monitoring and human computer...
Dong Huang, Markus Storer, Fernando DelaTorre, Hor...
CN
2008
117views more  CN 2008»
15 years 4 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
IJON
2007
74views more  IJON 2007»
15 years 4 months ago
Visual object concept discovery: Observations in congenitally blind children, and a computational approach
Over the course of the first few months of life, our brains accomplish a remarkable feat. They are able to interpret complex visual images so that instead of being just disconnec...
Jake V. Bouvrie, Pawan Sinha
RECOMB
2005
Springer
16 years 4 months ago
Rapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
Jinbo Xu