900 search results - page 106 / 180 » On Polynomial Time Computation over Unordered Structures |
RECOMB
2009
Springer
14 years 9 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
ICDE
2002
IEEE
14 years 10 months ago
2002
IEEE
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
PADS
2006
ACM
14 years 2 months ago
2006
ACM
A master/worker paradigm for executing large-scale parallel discrete event simulation programs over networkenabled computational resources is proposed and evaluated. In contrast t...
HPCS
2007
IEEE
14 years 3 months ago
2007
IEEE
One of the challenges in the large-scale simulations required for many molecular systems (such as those of biological interested) is the recording, monitoring and visualization of...