3128 search results - page 87 / 626 » Finite element method |
COMBINATORICS
2007
15 years 3 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
131
Voted
SIAMIS
2011
14 years 10 months ago
2011
In this paper we study finite-difference approximations to the variational problem using the BV smoothness penalty that was introduced in an image smoothing context by Rudin, Osh...
152
click to vote
MOC
1998
15 years 2 months ago
1998
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
116
click to vote
ISCAS
2007
IEEE
15 years 9 months ago
2007
IEEE
— We present a method for fast analysis of signal and power integrity based on a recently developed multilayered finite difference method (M-FDM). In order to accurately model m...
131
click to vote
WIA
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...