900 search results - page 105 / 180 » On Polynomial Time Computation over Unordered Structures |
WWW
2004
ACM
14 years 9 months ago
2004
ACM
We seek to gain improved insight into how Web search engines should cope with the evolving Web, in an attempt to provide users with the most up-to-date results possible. For this ...
BMCBI
2007
13 years 8 months ago
2007
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
SG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Volume datasets have been a primary representation for scientific visualization with the advent of rendering algorithms such as marching cubes and ray casting. Nonethele...
CADE
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...