Sciweavers

1399 search results - page 97 / 280
» Engineering search computing applications: vision and challe...
Sort
View
CVPR
2011
IEEE
14 years 10 months ago
A Non-convex Relaxation Approach to Sparse Dictionary Learning
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
Jianping Shi, Xiang Ren, Jingdong Wang, Guang Dai,...
MM
2009
ACM
260views Multimedia» more  MM 2009»
16 years 22 days ago
Web image mining towards universal age estimator
In this paper, we present an automatic web image mining system towards building a universal human age estimator based on facial information, which is applicable to all ethnic grou...
Bingbing Ni, Zheng Song, Shuicheng Yan
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
BMCBI
2006
116views more  BMCBI 2006»
15 years 6 months ago
MICA: desktop software for comprehensive searching of DNA databases
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
William A. Stokes, Benjamin S. Glick
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
16 years 11 days ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano