3625 search results - page 130 / 725 » On choosing |
152
click to vote
ICMCS
2007
IEEE
16 years 21 days ago
2007
IEEE
A common trait of background subtraction algorithms is that they have learning rates, thresholds, and initial values that are hand-tuned for a scenario in order to produce the des...
140
click to vote
IEEEIAS
2007
IEEE
16 years 20 days ago
2007
IEEE
There is a large number of research papers and standards dedicated to security for outsourced data. Yet, most papers propose new controls to access and protect the data rather tha...
173
click to vote
IPPS
2007
IEEE
16 years 20 days ago
2007
IEEE
Sparse linear solvers account for much of the execution time in many high-performance computing (HPC) applications, and not every solver works on all problems. Hence choosing a su...
262
click to vote
IPPS
2007
IEEE
16 years 20 days ago
2007
IEEE
Desktop grids have traditionally focused on executing computation intensive workloads. Can they also be used to execute data-intensive workloads? To answer this question, we prese...
147
click to vote
ISCAS
2007
IEEE
16 years 20 days ago
2007
IEEE
— The complexity of Finite Impulse Response (FIR) filters is dominated by the number of adders (subtractors) used to implement the coefficient multipliers. A greedy Common Subexp...