Sciweavers

9842 search results - page 1769 / 1969
» Compositional timing analysis
Sort
View
COMPGEOM
2011
ACM
14 years 7 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
161
Voted
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 6 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
CIKM
2011
Springer
14 years 3 months ago
Citation count prediction: learning to estimate future citations for literature
In most of the cases, scientists depend on previous literature which is relevant to their research fields for developing new ideas. However, it is not wise, nor possible, to trac...
Rui Yan, Jie Tang, Xiaobing Liu, Dongdong Shan, Xi...
EDM
2011
197views Data Mining» more  EDM 2011»
14 years 3 months ago
Towards Improvements on Domain-independent Measurements for Collaborative Assessment
Assessment on collaborative student behavior is a longstanding issue in user modeling. Nowadays thanks to the proliferation of online learning and the vast amount of data on studen...
Antonio R. Anaya, Jesus Boticario
JMLR
2012
13 years 5 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
« Prev « First page 1769 / 1969 Last » Next »