52 search results - page 1 / 11 » Generalized ERSS tree model: Revisiting working sets |
PE
2010
Springer
12 years 11 months ago
2010
Springer
Accurately characterizing the resource usage of an application at various levels in the memory hierarchy has been a long-standing research problem. Existing characterization studi...
CAI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
JMLR
2010
12 years 11 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
PODS
2008
ACM
14 years 5 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...