Sciweavers

526 search results - page 101 / 106
» On circularly symmetric functions
Sort
View
110
Voted
JCSS
2008
120views more  JCSS 2008»
14 years 11 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
IPMI
2005
Springer
16 years 15 days ago
Extrapolation of Sparse Tensor Fields: Application to the Modeling of Brain Variability
Modeling the variability of brain structures is a fundamental problem in the neurosciences. In this paper, we start from a dataset of precisely delineated anatomical structures in ...
Pierre Fillard, Vincent Arsigny, Xavier Pennec, Pa...
ICML
2002
IEEE
16 years 14 days ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
94
Voted
EUROCRYPT
2009
Springer
16 years 7 days ago
Smashing SQUASH-0
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
Khaled Ouafi, Serge Vaudenay
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 12 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...