11211 search results - page 1826 / 2243 » Rank-Sensitive Data Structures |
138
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
202
click to vote
BMCBI
2011
14 years 11 months ago
2011
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...
170
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: A fundamental goal of the U.S. National Institute of Health (NIH) "Roadmap" is to strengthen Translational Research, defined as the movement of discoveries i...
140
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
A linear, discriminative, supervised technique for reducing feature vectors extracted from image data to a lower-dimensional representation is proposed. It is derived from classica...
159
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
Abstract. This paper addresses the problem of probabilistically modeling 3D human motion for synthesis and tracking. Given the high dimensional nature of human motion, learning an ...