126 search results - page 11 / 26 » Error bounds for correlation clustering |
104
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
211
click to vote
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
FUIN
2010
14 years 8 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
TIT
2002
14 years 10 months ago
2002
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
115
click to vote
RT
1995
Springer
15 years 2 months ago
1995
Springer
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...