Sciweavers

1021 search results - page 33 / 205
» Fast Approximate PCPs
Sort
View
BMVC
2010
13 years 7 months ago
FAST: Fast Adaptive Silhouette Area based Template Matching
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
Daniel Mohr, Gabriel Zachmann
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
14 years 2 months ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
CASES
2010
ACM
13 years 5 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
FAST
2007
13 years 10 months ago
//TRACE: Parallel Trace Replay with Approximate Causal Events
//TRACE1 is a new approach for extracting and replaying traces of parallel applications to recreate their I/O behavior. Its tracing engine automatically discovers inter-node data ...
Michael P. Mesnier, Matthew Wachs, Raja R. Sambasi...
NIPS
2007
13 years 10 months ago
Fast Variational Inference for Large-scale Internet Diagnosis
Web servers on the Internet need to maintain high reliability, but the cause of intermittent failures of web transactions is non-obvious. We use approximate Bayesian inference to ...
John C. Platt, Emre Kiciman, David A. Maltz