75 search results - page 14 / 15 » Using DNA to solve the Bounded Post Correspondence Problem |
CPHYSICS
2006
13 years 6 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
ITNG
2007
IEEE
14 years 16 days ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
RTCSA
1998
IEEE
13 years 10 months ago
1998
IEEE
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...