Sciweavers

1974 search results - page 177 / 395
» On Unbiased Linear Approximations
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Stereo Matching via Disparity Estimation and Surface Modeling
Two new techniques are proposed to improve stereo matching performance in this work. First, to address the disparity discontinuity problem in occluded regions, we present a dispar...
Jong Dae Oh, Siwei Ma, C. C. Jay Kuo
168
Voted
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
16 years 7 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige
ALT
2004
Springer
16 years 3 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
STACS
2010
Springer
16 years 1 months ago
Dispersion in Unit Disks
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
Adrian Dumitrescu, Minghui Jiang
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
16 years 24 days ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson