Sciweavers

1668 search results - page 92 / 334
» Two Philosophical Applications of Algorithmic Information Th...
Sort
View
ICML
2009
IEEE
16 years 5 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
SEMWEB
2005
Springer
15 years 10 months ago
The Fuzzy Description Logic f-SHIN
Abstract. In the Semantic Web information would be retrieved, processed, combined, shared and reused in the maximum automatic way possible. Obviously, such procedures involve a hig...
Giorgos Stoilos, Giorgos B. Stamou, Vassilis Tzouv...
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 10 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 7 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
WAIM
2005
Springer
15 years 10 months ago
Similarity Search with Implicit Object Features
Driven by many real applications, in this paper we study the problem of similarity search with implicit object features; that is, the features of each object are not pre-computed/e...
Yi Luo, Zheng Liu, Xuemin Lin, Wei Wang 0011, Jeff...