900 search results - page 38 / 180 » On Polynomial Time Computation over Unordered Structures |
113
click to vote
ALMOB
2008
15 years 3 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...
184
Voted
DCC
2011
IEEE
14 years 9 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...
114
click to vote
TLCA
2007
Springer
15 years 9 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...
136
Voted
ALENEX
2010
15 years 4 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...
141
Voted
INFOCOM
2012
IEEE
13 years 5 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...