3818 search results - page 407 / 764 » Word Problems on Compressed Words |
194
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
154
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
150
click to vote
DEXAW
1997
IEEE
15 years 11 months ago
1997
IEEE
In order to solve the wear problem in terms of quality there is need for a experienced expert with a lengthy practice. Such valuable persons in practice are regularly missing and ...
144
click to vote
SPAA
1990
ACM
15 years 10 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
186
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...