Sciweavers

2254 search results - page 416 / 451
» Computing the minimal covering set
Sort
View
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 5 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
12 years 10 days ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
CVPR
2009
IEEE
1453views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Learning Photometric Invariance From Diversified Color Model Ensembles
Color is a powerful visual cue for many computer vision applications such as image segmentation and object recognition. However, most of the existing color models depend on the i...
Jose M. Alvarez, Theo Gevers, Antonio M. Lopez
CVPR
2004
IEEE
14 years 12 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
ICCV
2007
IEEE
14 years 12 months ago
Real-Time Visibility-Based Fusion of Depth Maps
We present a viewpoint-based approach for the quick fusion of multiple stereo depth maps. Our method selects depth estimates for each pixel that minimize violations of visibility ...
Paul Merrell, Amir Akbarzadeh, Liang Wang, Philipp...