Sciweavers

4047 search results - page 217 / 810
» The Discrete Basis Problem
Sort
View
131
Voted
AI
2000
Springer
15 years 3 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
112
Voted
MOC
2002
86views more  MOC 2002»
15 years 3 months ago
Hermite interpolation of nonsmooth functions preserving boundary conditions
Abstract. This article is devoted to the construction of a Hermite-type regularization operator transforming functions that are not necessarily C1 into globally C1 finite-element f...
V. Girault, L. R. Scott
188
Voted
NETWORKS
2011
14 years 10 months ago
Earliest arrival flows on series-parallel graphs
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
Stefan Ruzika, Heike Sperber, Mechthild Steiner
121
Voted
MOC
2010
14 years 10 months ago
Unified primal formulation-based a priori and a posteriori error analysis of mixed finite element methods
We derive in this paper a unified framework for a priori and a posteriori error analysis of mixed finite element discretizations of second-order elliptic problems. It is based on ...
Martin Vohralík
148
Voted
PKC
2001
Springer
116views Cryptology» more  PKC 2001»
15 years 8 months ago
Cryptanalysis of a Digital Signature Scheme on ID-Based Key-Sharing Infrastructures
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
Hongjun Wu, Feng Bao, Robert H. Deng