Sciweavers

4047 search results - page 87 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 5 days ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
ALT
2011
Springer
13 years 12 months ago
Deviations of Stochastic Bandit Regret
This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009...
Antoine Salomon, Jean-Yves Audibert
PAMI
2012
13 years 2 months ago
A Blur-Robust Descriptor with Applications to Face Recognition
—Understanding the effect of blur is an important problem in unconstrained visual analysis. We address this problem in the context of image-based recognition, by a fusion of imag...
Raghuraman Gopalan, Sima Taheri, Pavan K. Turaga, ...
IPM
2008
70views more  IPM 2008»
14 years 12 months ago
An h-index weighted by citation impact
An h-type index is proposed which depends on the obtained citations of articles belonging to the h-core. This weighted h-index, denoted as hw, is presented in a continuous setting...
Leo Egghe, Ronald Rousseau
APAL
2007
59views more  APAL 2007»
15 years 2 hour ago
On the Turing degrees of minimal index sets
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-tabl...
Jason Teutsch