1390 search results - page 192 / 278 » Self-Sizing of Clustered Databases |
116
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
102
click to vote
WWW
2007
ACM
16 years 2 months ago
2007
ACM
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
109
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
130
click to vote
FGR
2006
IEEE
15 years 7 months ago
2006
IEEE
An unsupervised nonparametric approach is proposed to automatically extract representative face samples (exemplars) from a video sequence or an image set for multipleshot face rec...
143
click to vote
ICMCS
2006
IEEE
15 years 7 months ago
2006
IEEE
This paper presents a new framework that integrates relevance feedback into region-based image retrieval (RBIR) systems based on radial basis function network (RBFN). A modified u...