Sciweavers

680 search results - page 57 / 136
» A randomized embedding algorithm for trees
Sort
View
BMCBI
2007
147views more  BMCBI 2007»
13 years 9 months ago
Bias in random forest variable importance measures: Illustrations, sources and a solution
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and relate...
Carolin Strobl, Anne-Laure Boulesteix, Achim Zeile...
ISLPED
2004
ACM
159views Hardware» more  ISLPED 2004»
14 years 2 months ago
Dynamic voltage scaling for systemwide energy minimization in real-time embedded systems
Traditionally, dynamic voltage scaling (DVS) techniques have focused on minimizing the processorenergy consumption as opposed to the entire system energy consumption. The slowdown...
Ravindra Jejurikar, Rajesh K. Gupta
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
INFOCOM
2003
IEEE
14 years 2 months ago
On Multicast Trees: Structure and Size Estimation
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
Danny Dolev, Osnat Mokryn, Yuval Shavitt
ICIP
1999
IEEE
14 years 10 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...