Sciweavers

3238 search results - page 169 / 648
» Multi-return function call
Sort
View
SIAMSC
2011
151views more  SIAMSC 2011»
13 years 3 months ago
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
Xiao-Chuan Cai, Xuefeng Li
OZCHI
2009
ACM
14 years 2 months ago
Doing things backwards: the OWL project
The OWL project is inspired by Arthur C. Clarke's Third Law of Technology Prediction: Any sufficiently advanced technology is indistinguishable from magic. It consists of a s...
Danielle Wilde, Kristina Andersen
ESOP
2009
Springer
14 years 2 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
FOCS
2007
IEEE
14 years 2 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
14 years 2 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang