Sciweavers

692 search results - page 64 / 139
» BDD minimization for approximate computing
Sort
View
82
Voted
COMPGEOM
2006
ACM
15 years 5 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
ICAI
2007
15 years 12 days ago
Dynamic Programming Algorithm for Training Functional Networks
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
Emad A. El-Sebakhy, Salahadin Mohammed, Moustafa E...
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 1 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
IPPS
2009
IEEE
15 years 5 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
ICDCS
2007
IEEE
15 years 2 months ago
Optimizing Multicast Performance in Large-Scale WLANs
Support for efficient multicasting in WLANs can enable new services such as streaming TV channels, radio channels, and visitor's information. With increasing deployments of l...
Ai Chen, Dongwook Lee, Prasun Sinha