Sciweavers

6110 search results - page 409 / 1222
» Approximate Computing
Sort
View
CMA
2011
15 years 1 months ago
Third-order family of methods in Banach spaces
Recently, Parida and Gupta [J. Comp. Appl. Math. 206 (2007), 873-877] used Rall’s recurrence relations approach (from 1961) to approximate roots of nonlinear equations, by develo...
Changbum Chun, Pantelimon Stanica, Beny Neta
DCC
2011
IEEE
15 years 1 months ago
Accurate estimates of the data complexity and success probability for various cryptanalyses
Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formula...
Céline Blondeau, Benoît Gérard...
NETWORKS
2011
15 years 1 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
SIAMSC
2008
123views more  SIAMSC 2008»
15 years 6 months ago
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
Rafael Bru, José Marín, José ...
MOBIHOC
2008
ACM
16 years 6 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao