3575 search results - page 279 / 715 » Structured motifs search |
185
click to vote
FOCS
1992
IEEE
15 years 11 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
179
click to vote
CANDC
2006
ACM
15 years 6 months ago
2006
ACM
On the basis of maximum weighted matching (MWM) algorithm, we introduced a dynamic weight related with stem length and used a recursive algorithm to predict RNA secondary structur...
207
click to vote
IEEEPACT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...
161
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
174
click to vote
GECCO
2003
Springer
16 years 12 hour ago
2003
Springer
This paper assumes a search space of fixed-length strings, where the size of the alphabet can vary from position to position. Structural crossover is mask-based crossover, and thu...