Sciweavers

2252 search results - page 38 / 451
» Improving Random Forests
Sort
View
FAST
2008
13 years 10 months ago
BPLRU: A Buffer Management Scheme for Improving Random Writes in Flash Storage
Flash memory has become the most important storage media in mobile devices, and is beginning to replace hard disks in desktop systems. However, its relatively poor random write pe...
Hyojun Kim, Seongjun Ahn
WIRN
2005
Springer
14 years 1 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
ICRA
2002
IEEE
106views Robotics» more  ICRA 2002»
14 years 27 days ago
An Improved Random Neighborhood Graph Approach
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
Libo Yang, Steven M. LaValle
3DOR
2008
13 years 10 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
ICALP
2001
Springer
14 years 13 days ago
Improved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
Amit Chakrabarti, Subhash Khot