4850 search results - page 365 / 970 » Approximate Data Structures with Applications |
298
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
185
click to vote
FSS
2008
15 years 5 months ago
2008
We propose new types of linguistic summaries of time-series data that extend those proposed in our previous papers. The proposed summaries of time series refer to the summaries of...
197
click to vote
JMLR
2010
15 years 1 months ago
2010
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
174
click to vote
SACMAT
2010
ACM
15 years 11 months ago
2010
ACM
There has been increasing interest in automatic techniques for generating roles for role based access control, a process known as role mining. Most role mining approaches assume t...
246
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...