520 search results - page 1 / 104 » Reductions Between Expansion Problems |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
ICPP
2002
IEEE
13 years 9 months ago
2002
IEEE
Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try...
CASES
2004
ACM
13 years 10 months ago
2004
ACM
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...
CDC
2009
IEEE
13 years 9 months ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...