Results 1  10
of
61,669
An Analytic Derivation of the Cost of Deposit Insurance and Loan Guarantees: An Application of Modern Option Pricing Theory
 Journal of Banking and Finance
, 1977
"... It is not uncommon in the arrangement of a loan to include as part of the financial package a guarantee of the loan by a third party. Examples are guarantees by a parent company of loans made to its subsidiaries or government guarantees of loans made to private corporations. Also included would be g ..."
Abstract

Cited by 444 (6 self)
 Add to MetaCart
be guarantees of bank deposits by the Federal Deposit Insurance Corporation. As with other forms of insurance, the issuing of a guarantee imposes a liability or cost on the guarantor. In this paper, a formula is derived to evaluate this cost. The method used is to demonstrate an isomorphic correspondence
isomorphism of
"... Resolution of conflicting views concerning frequencyresponse models for conducting materials with dispersive relaxation, and ..."
Abstract
 Add to MetaCart
Resolution of conflicting views concerning frequencyresponse models for conducting materials with dispersive relaxation, and
A Graduated Assignment Algorithm for Graph Matching
, 1996
"... A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated nonconvexity, twoway (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational comp ..."
Abstract

Cited by 373 (15 self)
 Add to MetaCart
complexity [O(lm), where l and m are the number of links in the two graphs] and robustness in the presence of noise offer advantages over traditional combinatorial approaches. The algorithm, not restricted to any special class of graph, is applied to subgraph isomorphism, weighted graph matching
The McKay correspondence as an equivalence of derived categories
 J. AMER. MATH. SOC
, 2001
"... The classical McKay correspondence relates representations of a finite subgroup G SL(2;C) to the cohomology of the wellknown minimal resolution of the Kleinian singularity C2=G. GonzalezSprinberg and Verdier [10] interpreted the McKay correspondence as an isomorphism on K theory, observing that t ..."
Abstract

Cited by 235 (7 self)
 Add to MetaCart
The classical McKay correspondence relates representations of a finite subgroup G SL(2;C) to the cohomology of the wellknown minimal resolution of the Kleinian singularity C2=G. GonzalezSprinberg and Verdier [10] interpreted the McKay correspondence as an isomorphism on K theory, observing
An efficient algorithm for graph isomorphism
 J. ASSOC. COMPUT. MACH
, 1970
"... A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representat ive graph and the reordered graph, are derived. The representative graph is a homomorphic image of the original graph; the reordered graph is constructe ..."
Abstract

Cited by 72 (0 self)
 Add to MetaCart
A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representat ive graph and the reordered graph, are derived. The representative graph is a homomorphic image of the original graph; the reordered graph
Isomorphisms and general derivations . . .
, 2011
"... In this paper, we prove the HyersUlamRassias stability of homomorphisms in proper CQ∗algebras and of generalized derivations on proper CQ∗algebras for the following CauchyJensen additive mappings: f ..."
Abstract
 Add to MetaCart
In this paper, we prove the HyersUlamRassias stability of homomorphisms in proper CQ∗algebras and of generalized derivations on proper CQ∗algebras for the following CauchyJensen additive mappings: f
The Sebastiani–Thom isomorphism in the derived category
 Compositio Math
"... Let f: X → C and g: Y → C be analytic functions. Let π1 and π2 denote the projections of X ×Y onto X and Y, respectively. In [ST], Sebastiani and Thom prove that the cohomology of the Milnor fibre of f ◦ π1 + g ◦ π2 is isomorphic to the tensor product of the cohomologies of the Milnor fibres of ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Let f: X → C and g: Y → C be analytic functions. Let π1 and π2 denote the projections of X ×Y onto X and Y, respectively. In [ST], Sebastiani and Thom prove that the cohomology of the Milnor fibre of f ◦ π1 + g ◦ π2 is isomorphic to the tensor product of the cohomologies of the Milnor fibres of
Graph isomorphism is in spp
 Information and Computation
"... We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more general result: we show that a generic problem FINDGROUP has an FPSPP algorithm. This general result has other consequences: ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more general result: we show that a generic problem FINDGROUP has an FPSPP algorithm. This general result has other consequences
On the Complexity of Polytope Isomorphism Problems
 Graphs and Combinatorics
, 2003
"... We show that the problem to decide whether two (convex) polytopes, given by their vertexfacet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the combinatorial polytope isom ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
isomorphism problem in bounded dimensions. Furthermore, we derive that the problems to decide whether two polytopes, given either by vertex or by facet descriptions, are projectively or affinely isomorphic are graph isomorphism hard.
InstructionIsomorphism in Program Execution
 In Proceedings of the Value Prediction Workshop
, 2003
"... This paper identifies a fundamental runtime program property: InstructionIsomorphism.An instruction instance is said to be isomorphic if its component  information derived from the instruction and its backward dynamic data dependence graph  is identical to the component of an instruction exec ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This paper identifies a fundamental runtime program property: InstructionIsomorphism.An instruction instance is said to be isomorphic if its component  information derived from the instruction and its backward dynamic data dependence graph  is identical to the component of an instruction
Results 1  10
of
61,669