Sciweavers

2168 search results - page 43 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
SAFECOMP
2007
Springer
14 years 1 months ago
Software Encoded Processing: Building Dependable Systems with Commodity Hardware
In future, the decreasing feature size and the reduced power supply will make it much more difficult to built reliable microprocessors. Economic pressure will most likely result in...
Ute Wappler, Christof Fetzer
PODC
2005
ACM
14 years 1 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
DAGSTUHL
2008
13 years 9 months ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini
CVPR
2008
IEEE
14 years 9 months ago
(BP)2: Beyond pairwise Belief Propagation labeling by approximating Kikuchi free energies
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
Ifeoma Nwogu, Jason J. Corso
FUIN
2006
98views more  FUIN 2006»
13 years 7 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson