900 search results - page 38 / 180 » On Polynomial Time Computation over Unordered Structures |
ALMOB
2008
13 years 9 months ago
2008
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
DCC
2011
IEEE
13 years 3 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
TLCA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
ALENEX
2010
13 years 10 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...