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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
40
click to vote
TCS
2011
179
views
Theoretical Computer Science
»
more
TCS 2011
»
Bitonic sorters of minimal depth
13 years 6 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 »
74
click to vote
SADM
2011
272
views
Applied Computing
»
more
SADM 2011
»
Random survival forests for high-dimensional data
13 years 6 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 »