2957 search results - page 406 / 592 » The Complexity of Polynomial-Time Approximation |
168
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
157
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Commonly, controllers for Linear ParameterVarying (LPV) systems are designed in continuous-time using a Linear Fractional Representation (LFR) of the plant. However, th...
166
click to vote
RT
2001
Springer
15 years 11 months ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
160
click to vote
IJCNN
2000
IEEE
15 years 11 months ago
2000
IEEE
Bayesian MLP neural networks are a flexible tool in complex nonlinear problems. The approach is complicated by need to evaluate integrals over high-dimensional probability distri...
171
click to vote
ANTS
2000
Springer
15 years 10 months ago
2000
Springer
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...