1439 search results - page 195 / 288 » Fast approximation of centrality |
126
Voted
GRAPHICSINTERFACE
2000
15 years 2 months ago
2000
As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplifica...
136
click to vote
ICANN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Learning algorithms relying on Gibbs sampling based stochastic approximations of the log-likelihood gradient have become a common way to train Restricted Boltzmann Machin...
98
Voted
TC
2008
15 years 17 days ago
2008
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute in...
84
Voted
TMI
2008
15 years 16 days ago
2008
We introduce a novel algorithm for the design of fast slice-selective spatially-tailored magnetic resonance imaging (MRI) excitation pulses. This method, based on sparse approximat...
103
click to vote
VC
2008
15 years 16 days ago
2008
Abstract We propose a method for non-uniform reconstruction of 3D scalar data. Typically, radial basis functions, trigonometric polynomials or shift-invariant functions are used in...