6365 search results - page 256 / 1273 » Fast Local Computation Algorithms |
175
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
184
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...
193
click to vote
CAV
2007
Springer
16 years 24 days ago
2007
Springer
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
194
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Multiple Instance Learning (MIL) provides a framework for training a discriminative classifier from data with ambiguous labels. This framework is well suited for the task of learni...
176
click to vote
ISSAC
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...