2924 search results - page 272 / 585 » Lower Bounds in Distributed Computing |
129
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
168
click to vote
COCO
2011
Springer
14 years 3 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
158
Voted
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
151
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
247
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...