Sciweavers

7522 search results - page 1085 / 1505
» Spacing memetic algorithms
Sort
View
IPPS
2009
IEEE
15 years 11 months ago
Dynamic parallelization for RNA structure comparison
In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
Eric Snow, Eric Aubanel, Patricia Evans
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
15 years 11 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
WADS
2009
Springer
257views Algorithms» more  WADS 2009»
15 years 11 months ago
Rank-Balanced Trees
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 11 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
CIKM
2009
Springer
15 years 11 months ago
Large margin transductive transfer learning
Recently there has been increasing interest in the problem of transfer learning, in which the typical assumption that training and testing data are drawn from identical distributi...
Brian Quanz, Jun Huan
« Prev « First page 1085 / 1505 Last » Next »