We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...
The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelev...
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
The classical Tower of Hanoi "puzzle" or "mathematical game", invented by the French mathematician Edouard Lucas in 1883, spans "base 2". The number ...
METAI is a generic process calculus that can be instantiated by supplying rewriting rules defining an operational semantics to make numerous process calculi such as the -calculus,...
Optimal (v, 4, 2, 1) optical orthogonal codes (OOC) with v <= 75 and v = 71 are classified up to equivalence. One (v, 4, 2, 1) OOC is presented for all v 181, for which an opt...
Abstract--Linear receivers are often used to reduce the implementation complexity of multiple antenna systems. In a traditional linear receiver architecture, the receive antennas a...
Jiening Zhan, Bobak Nazer, Uri Erez, Michael Gastp...
This paper uses Support Vector Machines (SVM) to fuse multiple classifiers for an offline signature system. From the signature images, global and local features are extracted and ...