Sciweavers

1007 search results - page 56 / 202
» Ensemble Feature Ranking
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 4 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
ICIP
2001
IEEE
14 years 11 months ago
Feature coincidence trees for registration of ultrasound breast images
Registration of an image, the query or reference, to a database of rotated and translated exemplars constitutes an important image retrieval and indexing application which arises i...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson
ICIP
2005
IEEE
14 years 11 months ago
Feature selection with nonparametric statistics
In this paper we discuss a general framework for feature selection based on nonparametric statistics. The three stage approach we propose is based on the assumption that the avail...
Emanuele Franceschi, Francesca Odone, Fabrizio Sme...
ICCV
2011
IEEE
12 years 10 months ago
Evaluation of Image Features Using a Photorealistic Virtual World
Image features are widely used in computer vision applications. They need to be robust to scene changes and image transformations. Designing and comparing feature descriptors requ...
Biliana Kaneva, Antonio Torralba, Bill Freeman
CHI
2005
ACM
14 years 10 months ago
Feature congestion: a measure of display clutter
Management of clutter is an important factor in the design of user interfaces and information visualizations, allowing improved usability and aesthetics. However, clutter is not a...
Ruth Rosenholtz, Yuanzhen Li, Jonathan Mansfield, ...