4066 search results - page 213 / 814 » Almost Complete Sets |
169
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
193
click to vote
EJC
2002
15 years 6 months ago
2002
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...
148
click to vote
CVIU
1999
15 years 6 months ago
1999
We show that we can effectively fit arbitrarily complex animation models to noisy data extracted from ordinary face images Our approach is based on least-squares adjustment, using...
191
click to vote
ORDER
2002
15 years 6 months ago
2002
The framework and the basic results of Wille on triadic concept analysis, including his Basic Theorem of Triadic Concept Analysis, are here generalized to n-dimensional formal cont...
131
click to vote
NA
2007
15 years 6 months ago
2007
Abstract. This work presents a formulation based on UPML for truncating conductive media by using a local and non-orthogonal coordinate system to solve Maxwell’s Equations by the...