Sciweavers

692 search results - page 24 / 139
» BDD minimization for approximate computing
Sort
View
PODC
2006
ACM
15 years 4 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
COMPUTING
2004
88views more  COMPUTING 2004»
14 years 10 months ago
Spline Curve Approximation and Design by Optimal Control Over the Knots
In [1] Optimal Control methods over re-parametrization for curve and surface design were introduced. The advantage of Optimal Control over Global Minimization such as in [17] is t...
Rony Goldenthal, Michel Bercovier
IPCO
2001
184views Optimization» more  IPCO 2001»
14 years 12 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
ECCV
2004
Springer
16 years 11 days ago
Intrinsic Images by Entropy Minimization
A method was recently devised for the recovery of an invariant image from a 3-band colour image. The invariant image, originally 1D greyscale but here derived as a 2D chromaticity,...
Graham D. Finlayson, Mark S. Drew, Cheng Lu
73
Voted
CLUSTER
2008
IEEE
15 years 8 days ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...