Sciweavers

292 search results - page 39 / 59
» Are Stable Instances Easy
Sort
View
89
Voted
IJCNN
2006
IEEE
15 years 6 months ago
An Adaptive Penalty-Based Learning Extension for Backpropagation and its Variants
Abstract— Over the years, many improvements and refinements of the backpropagation learning algorithm have been reported. In this paper, a new adaptive penalty-based learning ex...
Boris Jansen, Kenji Nakayama
107
Voted
ITCC
2005
IEEE
15 years 6 months ago
Comparison of Information Technology Adoption Rates across Laggards, Innovators and Others
It is important to predict and analyze user acceptance of information technology in order to address success and failures of technological products. The Theory of Reasoned Action ...
Rukmini Reddy Muduganti, Shravan Kumar Sogani, Hen...
ACISP
2005
Springer
15 years 6 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger
85
Voted
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 6 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
82
Voted
WISA
2004
Springer
15 years 6 months ago
Onions Based on Universal Re-encryption - Anonymous Communication Immune Against Repetitive Attack
Abstract. Encapsulating messages in onions is one of the major techniques providing anonymous communication in computer networks. To some extent, it provides security against traf...
Marcin Gomulkiewicz, Marek Klonowski, Miroslaw Kut...