8025 search results - page 357 / 1605 » Combinators Introduction: An Algorithm |
194
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper introduces a new algorithm for reconstructing signals with sparse spectrums from noisy compressive measurements. The proposed model-based algorithm takes the signal str...
181
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
144
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
188
click to vote
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
162
click to vote
ICDCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...