2168 search results - page 213 / 434 » Randomized Algorithms and Complexity Theory |
131
click to vote
SAC
2010
ACM
15 years 10 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...
123
click to vote
ICC
2008
IEEE
15 years 10 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...
155
Voted
CORR
2010
Springer
15 years 1 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 ...
192
Voted
TCAD
2010
14 years 10 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...
107
Voted
SIGIR
2002
ACM
15 years 3 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...