151 search results - page 20 / 31 » Computable Shell Decomposition Bounds |
ECCC
2010
13 years 4 months ago
2010
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
WCNC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Among all blind channel estimation problems, subspace-based algorithms are attractive due to its fastconverging nature. It primarily exploits the orthogonality structure of the ...
NIPS
2001
13 years 8 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
SDM
2011
SIAM
12 years 10 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...