4066 search results - page 173 / 814 » Almost Complete Sets |
146
click to vote
JGT
2007
15 years 6 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
153
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
In any real-life identification problem, only a finite number of data points is available. On the other hand, almost all results in stochastic identification pertain to asymptotic...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
182
click to vote
FS
2010
15 years 5 months ago
2010
The aim of this paper is to investigate the properties of stochastic volatility models, and to discuss to what extent, and with regard to which models, properties of the classical...
168
click to vote
JGT
2010
15 years 4 months ago
2010
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...