2957 search results - page 324 / 592 » The Complexity of Polynomial-Time Approximation |
180
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
190
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
168
click to vote
AAAI
2010
15 years 8 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
162
click to vote
NIPS
2008
15 years 8 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
176
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...