Sciweavers

3353 search results - page 544 / 671
» Laver and set theory
Sort
View
NIPS
2008
15 years 7 months ago
Relative Performance Guarantees for Approximate Inference in Latent Dirichlet Allocation
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
Indraneel Mukherjee, David M. Blei
OWLED
2008
15 years 7 months ago
Enhancing Web Portals with Ontology-Based Data Access: The Case Study of South Africa's Accessibility Portal for People with Dis
Abstract. Web portal software is relatively easy to set up and populate from the perspective of the end-user, but it leaves the back-end database devoid of subject domain semantics...
C. Maria Keet, Ronell Alberts, Aurona Gerber, Gibs...
NIPS
2007
15 years 7 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 7 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
AAAI
2006
15 years 7 months ago
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...
Rama Akkiraju, Biplav Srivastava, Anca-Andreea Iva...