6142 search results - page 131 / 1229 » The Complexity of Partition Functions |
111
click to vote
BIBE
2005
IEEE
15 years 3 months ago
2005
IEEE
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
EUROCRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
FMICS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. TTEthernet is a communication infrastructure for mixedcriticality systems that integrates dataflow from applications with different criticality levels on a single network...
120
click to vote
TNN
2010
14 years 4 months ago
2010
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—We present a new family of tight lower and upper bounds on the Gaussian Q-function Q(x). It is first shown that, for any x, the integrand ϕ(θ; x) of the Craig representation ...