Sciweavers

835 search results - page 123 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
14 years 3 days ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
FCT
2009
Springer
14 years 5 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
CVRMED
1997
Springer
14 years 2 months ago
Geometric constraint analysis and synthesis: methods for improving shape-based registration accuracy
Shape-based registration is a process for estimating the transformation between two shape representations of an object. It is used in many image-guided surgical systems to establis...
David A. Simon, Takeo Kanade
PAMI
2007
113views more  PAMI 2007»
13 years 10 months ago
Analytical Results on Style-Constrained Bayesian Classification of Pattern Fields
—We formalize the notion of style context, which accounts for the increased accuracy of the field classifiers reported in this journal recently. We argue that style context forms...
Sriharsha Veeramachaneni, George Nagy
ISVC
2007
Springer
14 years 4 months ago
Image Compression Using Data-Dependent Triangulations
We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided ...
Burkhard Lehner, Georg Umlauf, Bernd Hamann