16666 search results - page 193 / 3334 » Descriptive and Computational Complexity |
185
click to vote
SIGIR
2004
ACM
16 years 7 days ago
2004
ACM
Abstract. Today, peer-to-peer services can comprise a large and growing number of services, e.g. search services or services dealing with heterogeneous schemas in the context of Di...
161
click to vote
LPNMR
2005
Springer
16 years 9 days ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
180
click to vote
ACL
1993
15 years 8 months ago
1993
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
160
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—We consider strategies for the lossy transmission of a zero mean Gaussian source over a 2×2 MIMO channel with Rayleigh fading. The source is represented either using a single d...
148
click to vote
AAECC
2007
Springer
16 years 1 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...