1819 search results - page 164 / 364 » Computability and Representations of the Zero Set |
180
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
174
click to vote
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we propose a new set of parameters for audio signal analysis and classification. These parameters are regressions computed on the normalized modulation spectrum of h...
174
click to vote
COLING
2000
15 years 7 months ago
2000
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
171
click to vote
IJCM
2002
15 years 6 months ago
2002
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decompos...
165
click to vote
ICDE
1993
IEEE
15 years 10 months ago
1993
IEEE
To add time su port to the relational model, both first normal form (fNF and non-INF appmches have maining within 1NF when time support is added may introduce data redundancy. The...