Sciweavers

1124 search results - page 112 / 225
» Constructing Common Information Spaces
Sort
View
NRHM
2000
149views more  NRHM 2000»
15 years 4 months ago
Navigable history: a reader's view of writer's time
Collecting, analyzing, and sharing information via a hypertext results in the continuous modification of information content over a long period of time. Such tasks will benefit fr...
Frank M. Shipman III, Hao-wei Hsieh
BMCBI
2010
135views more  BMCBI 2010»
15 years 4 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
CVPR
2004
IEEE
16 years 6 months ago
Random Sampling LDA for Face Recognition
Linear Discriminant Analysis (LDA) is a popular feature extraction technique for face recognition. However, It often suffers from the small sample size problem when dealing with t...
Xiaogang Wang, Xiaoou Tang
ADBIS
2007
Springer
132views Database» more  ADBIS 2007»
15 years 10 months ago
Clustering Approach to Generalized Pattern Identification Based on Multi-instanced Objects with DARA
Clustering is an essential data mining task with various types of applications. Traditional clustering algorithms are based on a vector space model representation. A relational dat...
Rayner Alfred, Dimitar Kazakov
174
Voted
TIP
2010
155views more  TIP 2010»
15 years 2 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He