Sciweavers

530 search results - page 64 / 106
» Bounds on marginal probability distributions
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 6 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 8 months ago
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
We propose an information–theoretic approach to the watermark embedding and detection under limited detector resources. First, we present asymptotically optimal decision regions...
Neri Merhav, Erez Sabbag
AIRWEB
2005
Springer
14 years 1 months ago
Pagerank Increase under Different Collusion Topologies
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
Ricardo A. Baeza-Yates, Carlos Castillo, Vicente L...
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
14 years 8 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
TIT
2002
129views more  TIT 2002»
13 years 7 months ago
Arbitrary source models and Bayesian codebooks in rate-distortion theory
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
Ioannis Kontoyiannis, Junshan Zhang