Sciweavers

1389 search results - page 174 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
SECON
2010
IEEE
15 years 1 months ago
Multi-Constrained Anypath Routing in Wireless Mesh Networks
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue
CVPR
2010
IEEE
15 years 11 months ago
Far-Sighted Active Learning on a Budget for Image and Video Recognition
Active learning methods aim to select the most informative unlabeled instances to label first, and can help to focus image or video annotations on the examples that will most impr...
Sudheendra Vijayanarasimhan, Prateek Jain, Kristen...
CSDA
2006
94views more  CSDA 2006»
15 years 3 months ago
Simulation-based approach to estimation of latent variable models
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
Zhiguang Qian, Alexander Shapiro
ARITH
2011
IEEE
14 years 3 months ago
Short Division of Long Integers
—We consider the problem of short division — i.e., approximate quotient — of multiple-precision integers. We present ready-to-implement algorithms that yield an approximation...
David Harvey, Paul Zimmermann
EMSOFT
2007
Springer
15 years 9 months ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer