Sciweavers

1038 search results - page 207 / 208
» A Genetic Algorithm for Clustering on Very Large Data Sets
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 9 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
CVPR
2009
IEEE
15 years 21 days ago
Implicit Elastic Matching with Random Projections for Pose-variant Face Recognition
We present a new approach to robust pose-variant face recognition, which exhibits excellent generalization ability even across completely different datasets due to its weak depe...
John Wright (University of Illinois), Gang Hua (Mi...
CIKM
2011
Springer
12 years 5 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai
WWW
2009
ACM
14 years 6 months ago
A search-based method for forecasting ad impression in contextual advertising
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 7 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti