178 search results - page 7 / 36 » Computing Longest Previous Factor in linear time and applica... |
DCOSS
2006
Springer
14 years 3 days 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...
IJVR
2008
13 years 8 months ago
2008
Real-time virtual heritage application is normally executed with a high performance computer system. This is due to the complexity and highly computational cost which makes such sy...
FOCS
1999
IEEE
14 years 22 days ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
TAMC
2010
Springer
13 years 6 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...