Sciweavers

1450 search results - page 137 / 290
» On the Complexity of Hardness Amplification
Sort
View
RAS
2000
119views more  RAS 2000»
13 years 9 months ago
Benchmarking cerebellar control
Cerebellar models have long been advocated as viable models for robot dynamics control. Building on an increasing insight in and knowledge of the biological cerebellum, many model...
P. Patrick van der Smagt
ML
1998
ACM
13 years 8 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
MOBIHOC
2010
ACM
13 years 7 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
14 years 9 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
FOCS
2007
IEEE
14 years 3 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak