Sciweavers

6562 search results - page 243 / 1313
» Noetherianity and Combination Problems
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Unsupervised metric fusion by cross diffusion
Metric learning is a fundamental problem in computer vision. Different features and algorithms may tackle a problem from different angles, and thus often provide complementary inf...
Bo Wang, Jiayan Jiang, Wei Wang 0028, Zhi-Hua Zhou...
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 16 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 8 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
AI
1998
Springer
15 years 6 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf