Sciweavers

2996 search results - page 185 / 600
» Numberings and Randomness
Sort
View
CC
2010
Springer
117views System Software» more  CC 2010»
15 years 4 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
JCSS
2008
120views more  JCSS 2008»
15 years 6 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
MCS
2007
Springer
16 years 21 days ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
ICML
2005
IEEE
16 years 7 months ago
A comparison of tight generalization error bounds
We investigate the empirical applicability of several bounds (a number of which are new) on the true error rate of learned classifiers which hold whenever the examples are chosen ...
John Langford, Matti Kääriäinen
GLOBECOM
2009
IEEE
16 years 1 months ago
Capacity Gains of Some Frequency Reuse Schemes in OFDMA Networks
—The downlink capacity of cellular networks is known to be strongly limited by inter-cell interference. In order to mitigate this interference, a number of frequency reuse scheme...
Thomas Bonald, Nidhi Hegde