Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
127
Voted
TCS
2011
179
views
Theoretical Computer Science
»
more
TCS 2011
»
Bitonic sorters of minimal depth
14 years 9 months ago
Download
www.cs.technion.ac.il
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
Tamir Levi, Ami Litman
claim paper
Read More »
220
click to vote
SADM
2011
272
views
Applied Computing
»
more
SADM 2011
»
Random survival forests for high-dimensional data
14 years 9 months ago
Download
www.bio.ri.ccf.org
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
Hemant Ishwaran, Udaya B. Kogalur, Xi Chen, Andy J...
claim paper
Read More »