Sciweavers

1341 search results - page 106 / 269
» Probabilistic Abstraction Hierarchies
Sort
View
STACS
2001
Springer
15 years 11 months ago
Small PCPs with Low Query Complexity
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
Prahladh Harsha, Madhu Sudan
DAGM
2008
Springer
15 years 8 months ago
Comparing Local Feature Descriptors in pLSA-Based Image Models
Abstract. Probabilistic models with hidden variables such as probabilistic Latent Semantic Analysis (pLSA) and Latent Dirichlet Allocation (LDA) have recently become popular for so...
Eva Hörster, Thomas Greif, Rainer Lienhart, M...
ECIR
2006
Springer
15 years 8 months ago
A User-Item Relevance Model for Log-Based Collaborative Filtering
Abstract. Implicit acquisition of user preferences makes log-based collaborative filtering favorable in practice to accomplish recommendations. In this paper, we follow a formal ap...
Jun Wang, Arjen P. de Vries, Marcel J. T. Reinders
JMLR
2010
107views more  JMLR 2010»
15 years 1 months ago
Modeling Knowledge Worker Activity
This paper describes an approach to constructing a probabilistic process model representing knowledge worker activity out of a log of primitive events, such as e-mails, web page v...
Tadej Stajner, Dunja Mladenic
OOPSLA
2009
Springer
16 years 1 months ago
Static extraction and conformance analysis of hierarchical runtime architectural structure using annotations
An object diagram makes explicit the object structures that are only implicit in a class diagram. An object diagram may be missing and must extracted from the code. Alternatively,...
Marwan Abi-Antoun, Jonathan Aldrich