Sciweavers

1257 search results - page 39 / 252
» A generalization of Euler's constant
Sort
View
SBCCI
2009
ACM
187views VLSI» more  SBCCI 2009»
15 years 11 months 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
ICML
2009
IEEE
16 years 7 months ago
Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property
We present an algorithm for finding an ssparse vector x that minimizes the squareerror y - x 2 where satisfies the restricted isometry property (RIP), with isometric constant 2s ...
Rahul Garg, Rohit Khandekar
WASA
2009
Springer
165views Algorithms» more  WASA 2009»
16 years 23 days ago
Maximum Independent Set of Links under Physical Interference Model
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
Peng-Jun Wan, Xiaohua Jia, F. Frances Yao
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
16 years 9 days ago
Approximation Schemes for Packing Splittable Items with Cardinality Constraints
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Leah Epstein, Rob van Stee
FOCS
2005
IEEE
15 years 11 months ago
Approximation Algorithms for Unique Games
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
Luca Trevisan