773 search results - page 145 / 155 » Traversing the Machining Graph |
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
JMLR
2012
12 years 3 days ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
WWW
2010
ACM
14 years 4 months ago
2010
ACM
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
SIGGRAPH
2009
ACM
14 years 4 months ago
2009
ACM
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...
SPAA
1997
ACM
14 years 1 months ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...