67 search results - page 6 / 14 » Empirical Evaluation of Four Tensor Decomposition Algorithms |
SC
2003
ACM
14 years 21 days ago
2003
ACM
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This pa...
UAI
2004
13 years 8 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
TSE
2010
13 years 2 months ago
2010
Abstract-- Code and design smells are poor solutions to recurring implementation and design problems. They may hinder the evolution of a system by making it hard for software engin...
CHI
2009
ACM
14 years 4 days ago
2009
ACM
In this paper, we report a study that examines the relationship between image-based computational analyses of web pages and users’ aesthetic judgments about the same image mater...
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...