Sciweavers

97 search results - page 11 / 20
» Random Sampling from Pseudo-Ranked B Trees
Sort
View
CATA
2009
13 years 9 months ago
Nearest Shrunken Centroid as Feature Selection of Microarray Data
The nearest shrunken centroid classifier uses shrunken centroids as prototypes for each class and test samples are classified to belong to the class whose shrunken centroid is nea...
Myungsook Klassen, Nyunsu Kim
WISEC
2010
ACM
14 years 22 days ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
ICIP
2009
IEEE
13 years 5 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 6 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake
CVPR
2009
IEEE
15 years 3 months ago
Dictionary-Free Categorization of Very Similar Objects via Stacked Evidence Trees
Current work in object categorization discriminates among objects that typically possess gross differences which are readily apparent. However, many applications require making ...
Andrew Moldenke, Asako Yamamuro, David A. Lytle, E...