Sciweavers

300 search results - page 4 / 60
» Vertex Cover: Further Observations and Further Improvements
Sort
View
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 5 months ago
On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes
In the classical compress-and-forward relay scheme developed by (Cover and El Gamal, 1979), the decoding process operates in a successive way: the destination first decodes the co...
Xiugang Wu, Liang-Liang Xie
ECIR
2010
Springer
13 years 7 months ago
A Case for Automatic System Evaluation
Ranking a set retrieval systems according to their retrieval effectiveness without relying on relevance judgments was first explored by Soboroff et al. [13]. Over the years, a numb...
Claudia Hauff, Djoerd Hiemstra, Leif Azzopardi, Fr...
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
13 years 10 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
CVPR
2010
IEEE
1208views Computer Vision» more  CVPR 2010»
14 years 1 months ago
Visual Tracking Decomposition
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and motion changes of an object occur at the same time....
Junseok Kwon (Seoul National University), Kyoung M...
NIPS
2003
13 years 7 months ago
Boosting versus Covering
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
Kohei Hatano, Manfred K. Warmuth