Sciweavers

10901 search results - page 322 / 2181
» Approximations in Distributed Optimization
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Efficient MAP approximation for dense energy functions
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
Marius Leordeanu, Martial Hebert
FORMATS
2007
Springer
16 years 26 days ago
Hypervolume Approximation in Timed Automata Model Checking
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
Víctor A. Braberman, Jorge Lucángeli...
MICAI
2004
Springer
16 years 1 days ago
MultiGrid-Based Fuzzy Systems for Function Approximation
In this paper we make use of a modified Grid Based Fuzzy System architecture, which may provide an exponential reduction in the number of rules needed. We also introduce an algori...
Luis Javier Herrera, Héctor Pomares, Ignaci...
GLVLSI
2003
IEEE
219views VLSI» more  GLVLSI 2003»
15 years 12 months ago
Buffer sizing for minimum energy-delay product by using an approximating polynomial
This paper first presents an accurate and efficient method of estimating the short circuit energy dissipation and the output transition time of CMOS buffers. Next the paper descri...
Chang Woo Kang, Soroush Abbaspour, Massoud Pedram
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 11 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson