11740 search results - page 309 / 2348 » More Problems in Rewriting |
181
click to vote
JMLR
2006
15 years 6 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
200
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
146
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
275
click to vote
GIS
2009
ACM
16 years 7 months ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
165
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...