1957 search results - page 22 / 392 » Approximate algorithms for neural-Bayesian approaches |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
192
click to vote
SDM
2011
SIAM
14 years 13 days 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...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...