2168 search results - page 213 / 434 » Randomized Algorithms and Complexity Theory |
177
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
164
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— Joint eigenvalue distribution of the noncentral complex Wishart matrix, i.e. HH∗ where H is the nonzero-mean complex Gaussian random channel matrix of a multiple-inpu...
190
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
230
click to vote
TCAD
2010
15 years 1 months ago
2010
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
158
click to vote
SIGIR
2002
ACM
15 years 6 months ago
2002
ACM
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...