Sciweavers

1810 search results - page 159 / 362
» Similarity estimation techniques from rounding algorithms
Sort
View
CSDA
2006
71views more  CSDA 2006»
13 years 8 months ago
Computation of Huber's M-estimates for a block-angular regression problem
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
Xiao-Wen Chang
INFOCOM
2002
IEEE
14 years 1 months ago
Clock Synchronization Algorithms for Network Measurements
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
Li Zhang, Zhen Liu, Cathy H. Xia
RECOMB
2010
Springer
14 years 3 months ago
A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l-Tuples
Abstract. Metagenomics is the study of microbial communities sampled directly from their natural environment, without prior culturing. Among the computational tools recently develo...
Yu-Wei Wu, Yuzhen Ye
ICASSP
2008
IEEE
14 years 2 months ago
Blind optimization of algorithm parameters for signal denoising by Monte-Carlo SURE
We consider the problem of optimizing the parameters of an arbitrary denoising algorithm by minimizing Stein’s Unbiased Risk Estimate (SURE) which provides a means of assessing ...
Sathish Ramani, Thierry Blu, Michael Unser
CVPR
2004
IEEE
14 years 10 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma