205 search results - page 30 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
AVI
2004
13 years 8 months ago
2004
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
CGF
2008
13 years 7 months ago
2008
The powerful yet conceptually simple notions of Finite-Time Lyapunov Exponent (FTLE) and Lagrangian Coherent Structures provide a powerful framework for the analysis and visualiza...
IPSN
2005
Springer
14 years 28 days ago
2005
Springer
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
CLEF
2009
Springer
13 years 8 months ago
2009
Springer
In biological sequence processing, Multiple Sequence Alignment (MSA) techniques capture information about long-distance dependencies and the three-dimensional structure of protein ...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...