67 search results - page 11 / 14 » Parallel sparse polynomial multiplication using heaps |
FTDB
2007
13 years 8 months ago
2007
Database Management Systems (DBMSs) are a ubiquitous and critical component of modern computing, and the result of decades of research and development in both academia and industr...
IEEECGIV
2009
IEEE
14 years 3 months ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
IEEECIT
2010
IEEE
13 years 7 months ago
2010
IEEE
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...
PODC
2000
ACM
14 years 29 days ago
2000
ACM
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
BMVC
2001
13 years 11 months ago
2001
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...