Sciweavers

1810 search results - page 3 / 362
» Similarity estimation techniques from rounding algorithms
Sort
View
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 5 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
ECML
2007
Springer
13 years 11 months ago
Analyzing Co-training Style Algorithms
Co-training is a semi-supervised learning paradigm which trains two learners respectively from two different views and lets the learners label some unlabeled examples for each oth...
Wei Wang, Zhi-Hua Zhou
BMCBI
2006
126views more  BMCBI 2006»
13 years 5 months ago
A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data
Background: As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heteroge...
Zizhen Yao, Walter L. Ruzzo
CORR
2010
Springer
169views Education» more  CORR 2010»
13 years 5 months ago
Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements
This paper examines the ability of greedy algorithms to estimate a block sparse parameter vector from noisy measurements. In particular, block sparse versions of the orthogonal mat...
Zvika Ben-Haim, Yonina C. Eldar
ICASSP
2009
IEEE
13 years 11 months ago
Query by tapping system based on alignment algorithm
Query-by-tapping systems are content-based music retrieval systems that allow users to tap or clap in a microphone the rhythmic pattern of the melody requested. In this paper, a n...
Pierre Hanna, Matthias Robine