Sciweavers

560 search results - page 16 / 112
» Multiplication by a Constant is Sublinear
Sort
View
EJC
2008
13 years 8 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
SBCCI
2009
ACM
187views VLSI» more  SBCCI 2009»
14 years 19 days ago
Design of low complexity digital FIR filters
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
Levent Aksoy, Diego Jaccottet, Eduardo Costa
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
14 years 1 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
CDC
2008
IEEE
14 years 2 months ago
Controllability and observability of leader-based multi-agent systems
— In this work we analyze the controllability and observability properties of several interconnection configurations such as the chain topology and cyclic topology as well as co...
Rogelio Lozano, Mark W. Spong, Jose Alfredo Guerre...
LATIN
2010
Springer
14 years 2 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob