Sciweavers

13621 search results - page 382 / 2725
» Computability and Complexity in Self-assembly
Sort
View
ICIP
2001
IEEE
16 years 8 months ago
Adaptive algorithms for variable-complexity video coding
Variable-complexity algorithms provide a means of managing the computational complexity of a software video CODEC. The reduction in computational complexity provided by existing v...
Iain E. Garden Richardson, Yafan Zhao
EATCS
2002
46views more  EATCS 2002»
15 years 6 months ago
Understanding the Mulmuley-Sohoni Approach to P vs. NP
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
Kenneth W. Regan
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
16 years 29 days ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
ACMSE
2011
ACM
14 years 6 months ago
Targeting FPGA-based processors for an implementation-driven compiler construction course
This paper describes the adaptation of a modern compiler construction course to target an FPGA-based hardware platform used throughout our computer science curriculum. One of the ...
D. Brian Larkins, William M. Jones
PARA
2000
Springer
15 years 10 months ago
JavaGrande - High Performance Computing with Java
The JavaGrande Forum is a group of users, researchers, and interested parties from industry. The Forum members are either trying to use Java for resource-intensive applications or ...
Michael Philippsen, Ronald F. Boisvert, Vladimir G...