81 search results - page 12 / 17 » A Fast Random Sampling Algorithm for Sparsifying Matrices |
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing...
IMC
2010
ACM
13 years 5 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
ICIP
2000
IEEE
14 years 9 months ago
2000
IEEE
This paper presents a new non-iterative, closed-form approximation to the maximum entropy (M.E.) image restoration method. A fast frequency domain implementation of this closed fo...
BCS
2008
13 years 9 months ago
2008
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...