230 search results - page 27 / 46 » Faster algorithms for the characteristic polynomial |
ASPLOS
2010
ACM
14 years 8 months ago
2010
ACM
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...
EUROGRAPHICS
2010
Eurographics
15 years 4 months ago
2010
Eurographics
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
102
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
DAGSTUHL
1997
14 years 11 months ago
1997
Interactive rendering of large data sets requires fast algorithms and rapid hardware acceleration. Both can be improved, but none of this ensures interactive response times. If a ...