Sciweavers

3415 search results - page 134 / 683
» Lower Bounds for Kernelizations
Sort
View
ICML
2007
IEEE
16 years 5 months ago
Online kernel PCA with entropic matrix updates
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
Dima Kuzmin, Manfred K. Warmuth
EPEW
2007
Springer
15 years 10 months ago
Closed Form Absorption Time Bounds
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
Ana Busic, Nihal Pekergin
SIAMDM
2000
69views more  SIAMDM 2000»
15 years 4 months ago
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
Jaikumar Radhakrishnan, Amnon Ta-Shma
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 1 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
NIPS
2004
15 years 5 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg