3934 search results - page 465 / 787 » Approximate Schedulability Analysis |
174
Voted
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
201
click to vote
CORR
2012
Springer
14 years 3 months ago
2012
Springer
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and...
258
Voted
JMLR
2012
13 years 10 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
212
click to vote
PVLDB
2010
15 years 5 months ago
2010
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
207
Voted
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...