Sciweavers

2252 search results - page 193 / 451
» Improving Random Forests
Sort
View
170
Voted
ASIACRYPT
2011
Springer
14 years 2 months ago
Short Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Dennis Hofheinz, Tibor Jager, Eike Kiltz
139
Voted
CVPR
2012
IEEE
13 years 5 months ago
Top-down and bottom-up cues for scene text recognition
Scene text recognition has gained significant attention from the computer vision community in recent years. Recognizing such text is a challenging problem, even more so than the ...
Anand Mishra, Karteek Alahari, C. V. Jawahar
112
Voted
POLICY
2007
Springer
15 years 8 months ago
An Automated Framework for Validating Firewall Policy Enforcement
The implementation of network security devices such as firewalls and IDSs are constantly being improved to accommodate higher security and performance standards. Using reliable a...
Adel El-Atawy, Taghrid Samak, Zein Wali, Ehab Al-S...
SACRYPT
2007
Springer
141views Cryptology» more  SACRYPT 2007»
15 years 8 months ago
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
Johannes Blömer, Volker Krummel
138
Voted
IJON
2007
184views more  IJON 2007»
15 years 2 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen