19320 search results - page 306 / 3864 » On the complexity of computing determinants |
175
click to vote
ISCAS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Searching for an efficient summarization of multi-channel electroencephalogram (EEG) behavior is a challenging signal analysis problem. Recently, parallel factor analysis (PAR...
150
click to vote
ISSAC
2004
Springer
16 years 2 days ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
182
click to vote
SI3D
2003
ACM
15 years 12 months ago
2003
ACM
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
221
click to vote
COMAD
2009
15 years 7 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
190
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...