7504 search results - page 1089 / 1501 » Computing with Action Potentials |
178
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
192
click to vote
DATAMINE
2006
15 years 7 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
203
click to vote
DM
2006
15 years 7 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
138
click to vote
EWC
2006
15 years 7 months ago
2006
In engineering analysis, geometric symmetry, when exploited, has two potential benefits: (1) it can significantly reduce the computational time, and (2) it can simultaneously impr...
218
click to vote
CGF
2007
15 years 7 months ago
2007
Recently, several real-time soft shadow algorithms have been introduced which all compute a single shadow map and use its texels to obtain a discrete scene representation. The res...