Sciweavers

166 search results - page 18 / 34
» Black-Box Randomized Reductions in Algorithmic Mechanism Des...
Sort
View
JMLR
2010
151views more  JMLR 2010»
14 years 6 months ago
Understanding the difficulty of training deep feedforward neural networks
Whereas before 2006 it appears that deep multilayer neural networks were not successfully trained, since then several algorithms have been shown to successfully train them, with e...
Xavier Glorot, Yoshua Bengio
STACS
2005
Springer
15 years 5 months ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek
CIKM
2010
Springer
14 years 9 months ago
Online stratified sampling: evaluating classifiers at web-scale
Deploying a classifier to large-scale systems such as the web requires careful feature design and performance evaluation. Evaluation is particularly challenging because these larg...
Paul N. Bennett, Vitor R. Carvalho
ISLPED
2009
ACM
122views Hardware» more  ISLPED 2009»
15 years 6 months ago
Power-saving color transformation of mobile graphical user interfaces on OLED-based displays
Emerging organic light-emitting diode (OLED)-based displays have drastically different power consumption when displaying different colors, due to their emissive nature. They bring...
Mian Dong, Yung-Seok Kevin Choi, Lin Zhong
PET
2007
Springer
15 years 5 months ago
Pairing-Based Onion Routing
Abstract. This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactivel...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg