Sciweavers

692 search results - page 5 / 139
» BDD minimization for approximate computing
Sort
View
AUTOMATICA
2006
111views more  AUTOMATICA 2006»
14 years 10 months ago
The minimal disturbance invariant set: Outer approximations via its partial sums
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...
Chong Jin Ong, Elmer G. Gilbert
IM
2007
14 years 10 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
15 years 11 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
15 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
LCTRTS
2010
Springer
15 years 5 months ago
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
Minming Li, Chun Jason Xue, Tiantian Liu, Yingchao...