Sciweavers

3341 search results - page 209 / 669
» On Bounded Queries and Approximation
Sort
View
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
15 years 10 months ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
185
Voted
ECCV
2004
Springer
16 years 7 months ago
Accuracy of Spherical Harmonic Approximations for Images of Lambertian Objects under Far and Near Lighting
Various problems in Computer Vision become difficult due to a strong influence of lighting on the images of an object. Recent work showed analytically that the set of all images of...
Darya Frolova, Denis Simakov, Ronen Basri
ICALP
2001
Springer
15 years 10 months 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
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 7 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
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 8 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...