3341 search results - page 114 / 669 » On Bounded Queries and Approximation |
MP
1998
14 years 9 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
160
click to vote
VLDB
2006
ACM
15 years 10 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
112
click to vote
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
SMI
2005
IEEE
2005
IEEE
A Tracing Algorithm for Constructing Medial Axis Transform of 3D Objects Bound by Free-Form Surfaces
15 years 3 months ago
This paper presents an algorithm for generating the Medial Axis Transform(MAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the...
TIT
2008
14 years 9 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...