3875 search results - page 496 / 775 » Approximation algorithms for the 0-extension problem |
184
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
208
click to vote
PARA
2004
Springer
16 years 14 hour ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
177
click to vote
DCC
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
181
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
170
click to vote
UAI
2008
15 years 8 months ago
2008
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...