Sciweavers

846 search results - page 44 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
NIPS
2008
13 years 9 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
ICALP
2001
Springer
14 years 4 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
JCO
2007
149views more  JCO 2007»
13 years 7 months ago
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
Minghui Jiang
ASAP
2005
IEEE
118views Hardware» more  ASAP 2005»
14 years 1 months ago
Real-time H/W Implementation of the Approximate Discrete Radon Transform
The Radon transform (RT) is a widely studied algorithm used to perform image pattern extraction in fields such as computer graphics, medical imagery, and avionics. Real-time impl...
Michael T. Frederick, Nathan A. VanderHorn, Arun K...
PODS
2001
ACM
127views Database» more  PODS 2001»
14 years 7 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor