Sciweavers

962 search results - page 91 / 193
» Redundancy based feature selection for microarray data
Sort
View
BMCBI
2004
165views more  BMCBI 2004»
14 years 9 months ago
Analysis of oligonucleotide array experiments with repeated measures using mixed models
Background: Two or more factor mixed factorial experiments are becoming increasingly common in microarray data analysis. In this case study, the two factors are presence (Patients...
Hao Li, Constance L. Wood, Thomas V. Getchell, Mar...
CVPR
2010
IEEE
15 years 7 months ago
Online Visual Vocabulary Pruning Using Pairwise Constraints
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...
Pavan Mallapragada, Rong Jin and Anil Jain
EWCBR
2006
Springer
15 years 1 months ago
Fast Case Retrieval Nets for Textual Data
Case Retrieval Networks (CRNs) facilitate flexible and efficient retrieval in Case-Based Reasoning (CBR) systems. While CRNs scale up well to handle large numbers of cases in the c...
Sutanu Chakraborti, Robert Lothian, Nirmalie Wirat...
WIOPT
2010
IEEE
14 years 8 months ago
Lifetime optimization for wireless sensor networks with correlated data gathering
—The nodes in wireless sensor networks often collect correlated measurements. Not taking into account this information redundancy is detrimental to the network lifetime, since co...
Nashat Abughalieh, Yann-Aël Le Borgne, Kris S...
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
14 years 7 months ago
On improving the collision property of robust hashing based on projections
In this paper, we study the collision property of one of the robust hash functions proposed in [1]. This method was originally proposed for robust hash generation from blocks of i...
Regunathan Radhakrishnan, Wenyu Jiang, Claus Bauer