Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
JMLR
2010
114views more  JMLR 2010»
9 years 11 months ago
On the relation between universality, characteristic kernels and RKHS embedding of measures
Universal kernels have been shown to play an important role in the achievability of the Bayes risk by many kernel-based algorithms that include binary classification, regression, ...
Bharath K. Sriperumbudur, Kenji Fukumizu, Gert R. ...
ENTCS
2007
72views more  ENTCS 2007»
10 years 4 months ago
Pauli Measurements are Universal
Following a suggestion of Briegel, we show that a variant of the oneway model where one only allows X and Y one qubit measurements is approximately universal with respect to unita...
Vincent Danos, Elham Kashefi
IPL
2006
110views more  IPL 2006»
10 years 4 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
CORR
2006
Springer
121views Education» more  CORR 2006»
10 years 4 months ago
On the Foundations of Universal Sequence Prediction
Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior. We discuss in breadth how and in which...
Marcus Hutter
CORR
2006
Springer
111views Education» more  CORR 2006»
10 years 4 months ago
Universal decoding with an erasure option
Motivated by applications of rateless coding, decision feedback, and automatic repeat request (ARQ), we study the problem of universal decoding for unknown channels in the presence...
Neri Merhav, Meir Feder
CORR
2006
Springer
102views Education» more  CORR 2006»
10 years 4 months ago
Similarity of Objects and the Meaning of Words
We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extracti...
Rudi Cilibrasi, Paul M. B. Vitányi
FOCS
2008
IEEE
10 years 5 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
ICPADS
2005
IEEE
10 years 10 months ago
Universal Routing in Distributed Networks
We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that fro...
Kevin F. Chen, Edwin Hsing-Mean Sha, Bin Xiao
books