2600 search results - page 151 / 520 » Clustering with or without the Approximation |
198
click to vote
UAI
1997
15 years 7 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
219
click to vote
SIAMSC
2011
15 years 1 months ago
2011
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
214
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
167
click to vote
DAC
2011
ACM
14 years 6 months ago
2011
ACM
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...