Sciweavers

1494 search results - page 123 / 299
» Less Extreme Programming
Sort
View
122
Voted
IFIP
2004
Springer
15 years 8 months ago
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
Roman Dementiev, Peter Sanders, Dominik Schultes, ...
90
Voted
SAS
2004
Springer
106views Formal Methods» more  SAS 2004»
15 years 8 months ago
A Relational Approach to Interprocedural Shape Analysis
This paper addresses the verification of properties of imperative programs with recursive procedure calls, heap-allocated storage, and destructive updating of pointer-valued fiel...
Bertrand Jeannet, Alexey Loginov, Thomas W. Reps, ...
106
Voted
ISSRE
2003
IEEE
15 years 8 months ago
Using a Log-normal Failure Rate Distribution for Worst Case Bound Reliability Prediction
Prior research has suggested that the failure rates of faults follow a log normal distribution. We propose a specific model where distributions close to a log normal arise natural...
Peter G. Bishop, Robin E. Bloomfield
135
Voted
ICPR
2000
IEEE
15 years 7 months ago
Piecewise Linear Two-Dimensional Warping
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
Seiichi Uchida, Hiroaki Sakoe
93
Voted
IH
1998
Springer
15 years 7 months ago
On Software Protection via Function Hiding
Software piracy is a major economic problem: it leads to revenue losses, it favors big software houses that are less hurt by these losses and it prevents new software economy model...
Tomas Sander, Christian F. Tschudin