562 search results - page 5 / 113 » An Analysis of Transformational Analogy: General Framework a... |
ICMLA
2008
13 years 9 months ago
2008
In order to overcome the computation and storage problem for large-scale data set, an efficient iterative method of Generalized Discriminant Analysis is proposed. Because sample v...
DOCENG
2010
ACM
13 years 9 months ago
2010
ACM
Modern GUI toolkits, and especially RIA ones, propose the concept of binding to dynamically link domain data and their presentations. Bindings are very simple to use for predefine...
CGO
2005
IEEE
14 years 2 months ago
2005
IEEE
Data speculative optimization refers to code transformations that allow load and store instructions to be moved across potentially dependent memory operations. Existing research w...
JCP
2007
13 years 8 months ago
2007
— Presented in this paper is a joint algorithm optimization and architecture design framework for analysis of repetitive regularities. Two closely coupled algorithm optimization ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...