Sciweavers

613 search results - page 51 / 123
» Finding and Fixing Faults
Sort
View
DCC
2001
IEEE
15 years 11 months ago
How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
Marc Joye, Jean-Jacques Quisquater, Tsuyoshi Takag...
HICSS
2006
IEEE
117views Biometrics» more  HICSS 2006»
15 years 5 months ago
Network Effects and Technology Licensing
A paramount question faced by technology innovators is whether to license an innovation to other firms, and if so, what type of license it should use. Information technology innov...
Lihui Lin, Nalin Kulatilaka
AGILEDC
2003
IEEE
15 years 5 months ago
Agile Development in the old economy
As part of the delivery an automated hub for a postal operator, the Solystic company has to build a complex and feature rich Information System that supports a highly automated pr...
Géry Derbier
PRICAI
1998
Springer
15 years 4 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
SGP
2007
15 years 2 months ago
Data-dependent MLS for faithful surface approximation
In this paper we present a high-fidelity surface approximation technique that aims at a faithful reconstruction of piecewise-smooth surfaces from a scattered point set. The presen...
Yaron Lipman, Daniel Cohen-Or, David Levin