Sciweavers

108 search results - page 8 / 22
» Approximation Via Value Unification
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 10 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
PAMI
2002
108views more  PAMI 2002»
14 years 9 months ago
Approximate Bayes Factors for Image Segmentation: The Pseudolikelihood Information Criterion (PLIC)
We propose a method for choosing the number of colors or true gray levels in an image; this allows fully automatic segmentation of images. Our underlying probability model is a hid...
Derek C. Stanford, Adrian E. Raftery
CORR
2011
Springer
268views Education» more  CORR 2011»
14 years 1 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene
ECRTS
2009
IEEE
14 years 7 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan
GRAPP
2007
14 years 11 months ago
Fitting 3D morphable models using implicit representations
We consider the problem of approximating the 3D scan of a real object through an affine combination of examples. Common approaches depend either on the explicit estimation of poi...
Curzio Basso, Alessandro Verri