1308 search results - page 63 / 262 » Let's Have a Conversation |
APAL
2000
14 years 11 months ago
2000
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...
ARSCOM
1998
14 years 11 months ago
1998
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...
155
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
102
click to vote
FQ
2003
Springer
15 years 4 months ago
2003
Springer
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
ISMIR
2004
Springer
15 years 4 months ago
2004
Springer
This paper describes music information retrieval (MIR) systems featuring automatic speech recognition. Although various interfaces for MIR have been proposed, speech-recognition i...