484 search results - page 51 / 97 » Computing Hilbert Class Polynomials |
BMCBI
2007
13 years 8 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
SIGECOM
2003
ACM
14 years 2 months ago
2003
ACM
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
STOC
2005
ACM
14 years 2 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
TAMC
2010
Springer
13 years 7 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...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...